The Largest Component in Subcritical Inhomogeneous Random Graphs

Research output: Contribution to journalArticlepeer-review

9 Citations (SciVal)

Abstract

We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result complements the corresponding known result in the supercritical case. We provide some examples of applications of the derived formula.
Original languageEnglish
Pages (from-to)131-154
JournalCombinatorics, Probability & Computing
Volume20
Issue number1
DOIs
Publication statusPublished - 2011

Subject classification (UKÄ)

  • Probability Theory and Statistics

Fingerprint

Dive into the research topics of 'The Largest Component in Subcritical Inhomogeneous Random Graphs'. Together they form a unique fingerprint.

Cite this