The critical random graph, with martingales
Abstract
We give a short proof that the largest component of the random graph G(n, 1/n) is of size approximately n2/3. The proof gives explicit bounds for the probability that the ratio is very large or very small.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.