Susceptibility in subcritical random graphs

Abstract

We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the scaled fluctuations of the susceptibility around its deterministic limit converge to a Gaussian law. We further extend our results to higher moments of the component size of a random vertex, and prove that they are jointly asymptotically normal.

28 pages

References in corpus (1)

• Asymptotic normality of the $k$-core in random graphs

Cited by in corpus (6)

• Phase transitions for modified Erdös-Rényi processes
• On the critical probability in percolation
• Bounded-size rules: The barely subcritical regime
• Goodness-of-fit test for count distributions with finite second moment
• A moment-generating formula for Erdős-Rényi component sizes
• Noise Sensitivity of the Minimum Spanning Tree of the Complete Graph