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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Large deviations of subgraph counts for sparse random graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seoul Room 2S8, Donald McIntyre Building, Faculty of Education, 184 Hills Road, Cambridge Visual rhetoric and modern South Asian history

Other talks

Group Presentation 2 What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients Talk TBC Cooperation for Nature Spectral theory for Dirac operators with singular potentials Talk TBC
 

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