A New Approach to the Giant Component Problem

We study the largest component of a random (multi)graph on vertices with a given degree sequence. We let n -> infinity. Then, under sonic regularity conditions on the degree sequences. we give conditions on the asymptotic shape of the degree sequence that imply that with high probability all the components are small, and other conditions that imply that with high probability there is a giant component and the sizes of its vertex and edge sets satisfy a law of lane numbers; under suitable assumptions these are the only two possibilities. In particular. We recover the results by Molloy and Reed on the sire of the largest component in a random graph with a given degree sequence. We further obtain a new sharp result for the giant component just above the threshold, generalizing the case of G(n, p) with np = 1 + omega(n)n(-1/3), where omega(n) -> infinity arbitrarily slowly. Our method is based on the properties of empirical distributions of independent random variables, and leads to simple proofs. (C) 2008 Wiley Periodicals. Inc. Random Struct. Alg., 34, 197-216, 2009