The size of the largest component below phase transition in inhomogeneous random graphs

Tatyana S. Turova

Centre for Mathematical Sciences
Mathematical Statistics
Lund Institute of Technology,
Lund University,

ISSN 1403-9338
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. We provide some examples of applications of this formula.