Supercritical Site Percolation on Regular Graphs
Combinatorics
2026-03-20 v1 Probability
Abstract
We consider site (vertex) percolation on -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 : namely, the appearance of a unique giant component of order in the percolated subgraph, with all other components being of size . Our main results apply both to the -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.
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}
}