The Largest Component in Subcritical Inhomogeneous Random Graphs

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

Sammanfattning

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.
Originalspråkengelska
Sidor (från-till)131-154
TidskriftCombinatorics, Probability & Computing
Volym20
Nummer1
DOI
StatusPublished - 2011

Ämnesklassifikation (UKÄ)

  • Sannolikhetsteori och statistik

Fingeravtryck

Utforska forskningsämnen för ”The Largest Component in Subcritical Inhomogeneous Random Graphs”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här