Sciweavers

Share
RSA
2000

Growth of components in random graphs

9 years 11 months ago
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.
Svante Janson
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where RSA
Authors Svante Janson
Comments (0)
books