Authors
Citation
S. Janson, Growth of components in random graphs, RAND STR AL, 17(3-4), 2000, pp. 343-356
Citations number
14
Categorie Soggetti
Mathematics
Journal title
RANDOM STRUCTURES & ALGORITHMS
ISSN journal
10429832
→ ACNP
Volume
17
Issue
3-4
Year of publication
2000
Pages
343 - 356
Database
ISI
SICI code
1042-9832(200010/12)17:3-4<343:GOCIRG>2.0.ZU;2-S
Abstract
The creation and growth of components of a given complexity in a random gra
ph process are studied. In particular, the expected number and total size o
f all such components is found. It follows that the largest I-component dur
ing the process is O-p(n(2/3)) for any given l. The results also yield a ne
w proof of the asymptotic behaviour of Wright's coefficients. (C) 2000 John
Wiley & Sons, Inc.