Growth of components in random graphs
Svante Janson · Random Structures and Algorithms · 2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found. It follows that the largest l-component during the process is Op(n2/3) for any given l. The results also yield a new proof of the asymptotic behaviour of Wright's coefficients. © 2000 John Wiley & Sons, Inc. Random Struct. Alg., 17: 343–356, 2000