The Largest Component in Subcritical Inhomogeneous Random Graphs

Tatyana Turova

doi:10.1017/S0963548310000180

The Largest Component in Subcritical Inhomogeneous Random Graphs

Tatyana Turova

Mathematical Statistics

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	131-154
Journal	Combinatorics, Probability & Computing
Volume	20
Issue number	1
DOIs	https://doi.org/10.1017/S0963548310000180
Publication status	Published - 2011

Subject classification (UKÄ)

Probability Theory and Statistics

Access to Document

10.1017/S0963548310000180

Cite this

@article{31e930f095e341d58c2cbe346c18f2e4,

title = "The Largest Component in Subcritical Inhomogeneous Random Graphs",

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.",

author = "Tatyana Turova",

year = "2011",

doi = "10.1017/S0963548310000180",

language = "English",

volume = "20",

pages = "131--154",

journal = "Combinatorics, Probability & Computing",

issn = "1469-2163",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

T1 - The Largest Component in Subcritical Inhomogeneous Random Graphs

AU - Turova, Tatyana

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1017/S0963548310000180

DO - 10.1017/S0963548310000180

M3 - Article

SN - 1469-2163

VL - 20

SP - 131

EP - 154

JO - Combinatorics, Probability & Computing

JF - Combinatorics, Probability & Computing

IS - 1

ER -

The Largest Component in Subcritical Inhomogeneous Random Graphs

Abstract

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this