Components, large and small, are as they should be I: Supercritical percolation on regular graphs of growing degree
Abstract
We provide sufficient conditions for a regular graph G G of growing degree d d , guaranteeing a phase transition in its random subgraph G p G_p similar to that of G ( n , p ) G(n,p) when p ⋅ d ≈ 1 p\cdot d\approx 1 . These conditions capture several well-studied graphs, such as (percolation on) the complete graph K n K_n , the binary hypercube Q d Q^d , d d -regular expanders, and random d d -regular graphs. In particular, this serves as a unified proof for these (and other) cases. Suppose that G G is a d d -regular graph on n n vertices, with d = ω ( 1 ) d=\omega (1) . Let ϵ > 0 \epsilon >0 be a small constant, and let p = 1 + ϵ
Fields of Study & Subjects
Complex Network Analysis Techniques
Stochastic processes and statistical mechanics
Theoretical and Computational Physics
Publication details
- Journal / source
- Transactions of the American Mathematical Society
- Volume
- 379
- Issue
- 10
- Pages
- 7251–7270
- Publication date
- 2 July 2026
- Language
- EN