Large deviations and regularity method for sparse random hypergraphs

Large deviations and regularity method for sparse random hypergraphs

Probability Seminar
Sep 29, 2021, 03:10 PM - 04:00 PM | Zoom (https://berkeley.zoom.us/j/95636543170) | Happening As Scheduled
Nicholas Cook, Duke University

The "infamous upper tail" problem for subgraph counts in Erdős–Rényi graphs has received considerable attention since it was popularized by Janson and Rucinski, and has connections with questions in graph limit theory and statistical physics. I will survey work in this area and discuss a new approach for the more general setting of hypergraphs, based on an extension of the regularity method...