University of Cambridge > > Probability > Large deviations of subgraph counts for sparse random graphs

Large deviations of subgraph counts for sparse random graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi.

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.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity