Home / Events / Large deviations of subgraph counts for sparse random graphs
Probability Seminars

Large deviations of subgraph counts for sparse random graphs

With Amir Dembo (Stanford)

Large deviations of subgraph counts for sparse random graphs

In this talk, based on a recent joint work with Nick Cook, I will discuss recent developments
in the emerging theory of nonlinear large deviations focusing on sharp upper tails for counts
of a fixed subgraph in a large sparse Erdos–Renyi graph. In particular, I will explain our approach
via quantitative versions of the regularity and counting lemmas suitable for the study of sparse
random graphs in the large deviations regime.

Add to your calendar or Include in your list