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.
Date: 3 June 2019, 12:00 (Monday, 6th week, Trinity 2019)
Venue: Mathematical Institute, Woodstock Road OX2 6GG
Speaker: Amir Dembo (Stanford University)
Organising department: Department of Statistics
Part of: Probability seminar
Booking required?: Not required
Audience: Public
Editors: Christina Goldschmidt, James Martin