Anatomy of the giant component: The strictly supercritical regime

In a recent work of the authors and Kim, we derived a complete description of the largest component of the Erdos-Renyi random graph G(n,p) as it emerges from the critical window, i.e. for p=(1+@e)/n where @e^3n->~ and @e=o(1), in terms of a tractable contiguous model. Here we provide the analogous description for the supercritical giant component, i.e. the largest component of G(n,p) for p=@l/n where @l>1 is fixed. The contiguous model is roughly as follows. Take a random degree sequence and sample a random multigraph with these degrees to arrive at the kernel; replace the edges by paths whose lengths are i.i.d. geometric variables to arrive at the 2-core; attach i.i.d. Poisson-Galton-Watson trees to the vertices for the final giant component. As in the case of the emerging giant, we obtain this result via a sequence of contiguity arguments at the heart of which are Kim's Poisson-cloning method and the Pittel-Wormald local limit theorems.