pith. sign in

arxiv: 0806.0252 · v1 · submitted 2008-06-02 · 🧮 math.PR · math.CO

Susceptibility in subcritical random graphs

classification 🧮 math.PR math.CO
keywords randomsusceptibilityprovesubcriticalaroundasymptoticallyasymptoticscomponent
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.