English

The component sizes of a critical random graph with given degree sequence

Probability 2014-09-12 v3

Abstract

Consider a critical random multigraph Gn\mathcal{G}_n with nn vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution ν\nu (criticality means that the second moment of ν\nu is finite and equals twice its first moment). We specify the scaling limits of the ordered sequence of component sizes of Gn\mathcal{G}_n as nn tends to infinity in different cases. When ν\nu has finite third moment, the components sizes rescaled by n2/3n^{-2/3} converge to the excursion lengths of a Brownian motion with parabolic drift above past minima, whereas when ν\nu is a power law distribution with exponent γ(3,4)\gamma\in(3,4), the components sizes rescaled by n(γ2)/(γ1)n^{-(\gamma -2)/(\gamma-1)} converge to the excursion lengths of a certain nontrivial drifted process with independent increments above past minima. We deduce the asymptotic behavior of the component sizes of a critical random simple graph when ν\nu has finite third moment.

Keywords

Cite

@article{arxiv.1012.2352,
  title  = {The component sizes of a critical random graph with given degree sequence},
  author = {Adrien Joseph},
  journal= {arXiv preprint arXiv:1012.2352},
  year   = {2014}
}

Comments

Published in at http://dx.doi.org/10.1214/13-AAP985 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

R2 v1 2026-06-21T16:56:46.452Z