Large deviations of subgraph counts for sparse random graphs

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

• Amir Dembo (Stanford)
• Tuesday 04 June 2019, 14:00-15:00
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.