Critical percolation on scale-free random graphs: New universality class for the configuration model
Souvik Dhara, Remco van der Hofstad, and Johan S.H. van Leeuwaarden

TL;DR
This paper investigates the critical percolation behavior on scale-free random graphs with infinite second moments, revealing a new universality class characterized by unique scaling limits and component structures.
Contribution
It identifies the critical window and scaling limits for percolation on the configuration model with infinite second moments, introducing a new universality class.
Findings
Critical window for percolation on the configuration model identified.
Scaling limits for component sizes and surplus edges established.
Maximum diameter of critical components is of order log n.
Abstract
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent . It is well known that, in this regime, many canonical random graph models, such as the configuration model, are robust in the sense that the giant component is not destroyed when the percolation probability stays bounded away from zero. Thus, the critical behavior is observed when the percolation probability tends to zero with the network size, despite of the fact that the average degree remains bounded. In this paper, we initiate the study of critical random graphs in the infinite second-moment regime by identifying the critical window for the configuration model. We prove scaling limits for component sizes and surplus edges, and show that the maximum diameter the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
