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.

• Speaker: Amir Dembo (Stanford)
• Tuesday 04 June 2019, 14:00–15:00
• Venue: MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
• Series: Probability; organiser: Perla Sousi.