Supercritical Site Percolation on Regular Graphs

Abstract

We consider site (vertex) percolation on d-regular graphs, for both constant-degree and growing-degree cases. We give sufficient, and relatively tight, conditions for the emergence of the ``Erdos-R\'enyi component phenomenon" in the supercritical regime p=1+εd-1: namely, the appearance of a unique giant component of order n/d in the percolated subgraph, with all other components being of size O( n). Our main results apply both to the d-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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…