Asymptotics in percolation on high-girth expanders
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov

TL;DR
This paper analyzes the size, degree distribution, and structural properties of the giant component in supercritical bond percolation on high-girth regular expanders, revealing differences from classical random graphs.
Contribution
It provides sharp asymptotics for the giant component and its 2-core, and shows that the second largest component can be nearly linear in size, contrasting with Erdős-Rényi behavior.
Findings
The giant component's size and degree distribution are precisely characterized.
The second largest component can be almost linear in size, unlike in Erdős-Rényi graphs.
The existence of a linear path within the giant component is established.
Abstract
We consider supercritical bond percolation on a family of high-girth -regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linear-sized ("giant'') component is . Our main result recovers the sharp asymptotics of the size and degree distribution of the vertices in the giant and its 2-core at any . It was further shown in [ABS04] that the second largest component, at any , has size at most for some . We show that, unlike the situation in the classical Erd\H{o}s-R\'enyi random graph, the second largest component in bond percolation on a regular expander, even with an arbitrarily large girth, can have size for arbitrarily close to . Moreover, as a by-product of that construction, we answer negatively a question of Benjamini (2013) on the relation…
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.
