Growth of components in random graphs

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 -component during the process is Op(n2/3 ) for any given . The results also yield a new proof of the asymptotic behaviour of Wright's coefficients.

• Type: Journal
• Year: 2000
• Where: RSA
• Authors: Svante Janson
• Keywords: Expected Number, Random Graph Process, RSA 2000, Total Size