The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Large Deviation Principle for the Erdös-Renyi random graph

Chatterjee, S (Courant Institute)
Friday 01 April 2011, 14:00-15:00

Seminar Room 1, Newton Institute


What does an Erdos-Renyi graph look like when a rare event happens? I will describe an answer to this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and proof of the main result uses the recent development of the theory of graph limits by Lovasz and coauthors and Szemeredi's regularity lemma from graph theory. As a basic application of the general principle, we work out large deviations for the number of triangles in G(n,p). Surprisingly, even this simple example yields an interesting double phase transition. This is based on joint work with S. R. S. Varadhan.


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧