The largest component in a subcritical random graph with a power law degree distribution (Q939085): Difference between revisions

A uniform random graph \(G\) of order n with a fixed degree sequence is considered. The proportion of vertices of degree \(k\) tends to \(p_k\) for \(k\geq 0\) as \(n\to\infty\). For large \(k\), \(p_k\) is proportional to \(k^{-\gamma}\) for some \(\gamma>1\). It is shown that for \(\gamma>3\) the largest component of \(G\) is of order \(n^{1/(\gamma-1)}\). With high probability the \(j\)th largest component of \(G\) is approximately proportional to the \(j\)th largest degree for \(j\geq 1\).