Asymptotics for the size of the largest component scaled to "logn" in inhomogeneous random graphs
We study inhomogeneous random graphs in the subcritical case. Among other results, we derive an exact formula for the size of the largest connected component scaled by logn, with n being the size of the graph. This generalizes a result for the "rank-1 case". We also investigate branching processes associated with these graphs. In particular, we discover that the same well-known equation for the su
