Percolation through Isoperimetry
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich

TL;DR
This paper establishes a tight isoperimetric condition on regular graphs that predicts the emergence of a giant component in percolated graphs, similar to Erdős–Rényi models, and extends the analysis to controlled expansion scenarios.
Contribution
It provides a precise isoperimetric criterion for phase transition in percolation on regular graphs, including tightness results and generalizations to partial expansion controls.
Findings
Giant component emerges around p=1/d under isoperimetric conditions
Condition is shown to be tight for the phase transition
Extension to partial expansion scenarios with size-controlled sets
Abstract
We provide a sufficient condition on the isoperimetric properties of a regular graph of growing degree , under which the random subgraph typically undergoes a phase transition around which resembles the emergence of a giant component in the binomial random graph model . We further show that this condition is tight. More precisely, let , let be a small enough constant, and let . We show that if is sufficiently large and is a -regular -vertex graph where every subset of order at most has edge-boundary of size at least , then typically has a unique linear sized component, whose order is asymptotically , where is the survival probability of a Galton-Watson tree with offspring distribution Po. We further…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Limits and Structures in Graph Theory · Mathematical Dynamics and Fractals
