Critical percolation on preferential attachment graphs with infinite variance
Abstract
We study the inhomogeneous random graph with preferential attachment kernel and degree distribution with power-law exponent as a representative of the class of graphs of preferential attachment type with infinite variance degrees. Under bond percolation with a positive retention probability independent of the size of the graph there is a unique macroscopic component with high probability. We therefore investigate percolation probabilities . We identify a moving critical window at . Above this window, when , the maximal component has size of order and it is unique. Below this window, when , it is non-unique, star-shaped and has size of order . In the critical window itself, the largest component scaled by converges in distribution to a positive random variable with a law given in terms of a subcritical Norros-Reittu graph. This behaviour is markedly different from that seen for other classes of scale-free graphs and is conjectured to persist throughout the broad class of growing graphs with infinite variance.
Cite
@article{arxiv.2606.27844,
title = {Critical percolation on preferential attachment graphs with infinite variance},
author = {Peter Mörters and Lucas Schätze},
journal= {arXiv preprint arXiv:2606.27844},
year = {2026}
}
Comments
35 pages