Asymptotics for the size of the largest component scaled to "log n" in inhomogeneous random graphs
Abstract
Description
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the "rank 1 case". Here we discover that the same well-known equation for the survival probability, whose positive solution determines the asymptotics of the size of the largest component in the supercritical case, plays the crucial role in the subcritical case as well. But now these are the negative solutions which come into play.
34 pages
34 pages