Deriving an underlying mechanism for discontinuous percolation
Wei Chen, Zhiming Zheng, and Raissa M. D'Souza

TL;DR
This paper introduces a stochastic graph evolution model demonstrating that growth by overtaking causes discontinuous percolation transitions, with the transition nature depending on a parameter, and reveals unique component size distributions without finite size effects.
Contribution
The study derives a simple mechanism, growth by overtaking, responsible for discontinuous percolation, and characterizes how the transition type depends on a key parameter.
Findings
Discontinuous transition driven by overtaking for β<1
Weakly discontinuous transition for β>1
Unique component size distributions with no finite size effects
Abstract
Understanding what types of phenomena lead to discontinuous phase transitions in the connectivity of random networks is an outstanding challenge. Here we show that a simple stochastic model of graph evolution leads to a discontinuous percolation transition and we derive the underlying mechanism responsible: growth by overtaking. Starting from a collection of isolated nodes, potential edges chosen uniformly at random from the complete graph are examined one at a time while a cap, , on the maximum allowed component size is enforced. Edges whose addition would exceed can be simply rejected provided the accepted fraction of edges never becomes smaller than a function which decreases with as . We show that if it is always possible to reject a sampled edge and the growth in the largest component is dominated by an overtaking mechanism…
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.
