The largest component in subcritical inhomogeneous random graphs

Authors:
Tatyana s. Turova
Affiliations:
Mathematical center, university of lund, box 118, lund s-221 00, sweden (e-mail: tatyana@maths.lth.se)
Venue:
Combinatorics, Probability and Computing
Year:
2011

Citing 3
Cited 0

The Volume of the Giant Component of a Random Graph with Given Expected Degrees

SIAM Journal on Discrete Mathematics
The phase transition in inhomogeneous random graphs

Random Structures & Algorithms
Merging percolation on Zd and classical random graphs: Phase transition

Random Structures & Algorithms

Quantified Score

Hi-index	0.01

Visualization

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.