Component sizes of the random graph outside the scaling window

Abstract

We provide simple proofs describing the behavior of the largest component of the Erdos-Renyi random graph G(n,p) outside of the scaling window, p={1+\eps(n) \over n} where \eps(n) tends to 0, but \eps(n)n^{1/3} tends to \infty.

13 pages

Cited by in corpus (11)

• The phase transition in the configuration model
• Asymptotic normality of the size of the giant component in a random hypergraph
• The local weak limit of the minimum spanning tree of the complete graph
• Mixing time of near-critical random graphs
• Exploring hypergraphs with martingales
• Self-organized criticality in a discrete model for Smoluchowski's equation
• Expansion of percolation critical points for Hamming graphs
• Central limit theorem for statistics of subcritical configuration models
• Bohman-Frieze processes at criticality and emergence of the giant component
• A simple branching process approach to the phase transition in $G_{n,p}$
• Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs