English

Supercritical Site Percolation on Regular Graphs

Combinatorics 2026-03-20 v1 Probability

Abstract

We consider site (vertex) percolation on dd-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erd\H{o}s-R\'enyi component phenomenon" in the supercritical regime p=1+ϵd1p=\frac{1+\epsilon}{d-1}: namely, the appearance of a unique giant component of order n/dn/d in the percolated subgraph, with all other components being of size O(logn)O(\log n). Our main results apply both to the dd-dimensional hypercube and to pseudo-random graphs, and resolve two open questions in these cases. We further discuss differences (and similarities) between bond (edge) percolation setting and site percolation setting.

Keywords

Cite

@article{arxiv.2603.19038,
  title  = {Supercritical Site Percolation on Regular Graphs},
  author = {Sahar Diskin and Michael Krivelevich and Itay Markbreit},
  journal= {arXiv preprint arXiv:2603.19038},
  year   = {2026}
}
R2 v1 2026-07-01T11:28:22.457Z