Growth of components in random graphs
2000 (English)In: RANDOM STRUCTURES & ALGORITHMS, ISSN 1042-9832, Vol. 17, no 3-4, 343-356 p.Article in journal (Refereed) Published
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 I-component during the process is O-p(n(2/3))
Place, publisher, year, edition, pages
JOHN WILEY & SONS LTD , 2000. Vol. 17, no 3-4, 343-356 p.
IdentifiersURN: urn:nbn:se:uu:diva-36598OAI: oai:DiVA.org:uu-36598DiVA: diva2:64497
Addresses: Janson S, Univ Uppsala, Dept Math, POB 480, S-75106 Uppsala, Sweden. Univ Uppsala, Dept Math, S-75106 Uppsala, Sweden.2008-10-172008-10-172011-01-14