uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Growth of components in random graphs
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.
2000 (English)In: RANDOM STRUCTURES & ALGORITHMS, ISSN 1042-9832, Vol. 17, no 3-4, 343-356 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
PHASE-TRANSITION
Identifiers
URN: urn:nbn:se:uu:diva-36598OAI: oai:DiVA.org:uu-36598DiVA: diva2:64497
Note
Addresses: Janson S, Univ Uppsala, Dept Math, POB 480, S-75106 Uppsala, Sweden. Univ Uppsala, Dept Math, S-75106 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Department of Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 369 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf