Sharpness and Locality for Percolation on Finite Transitive Graphs


Loading...

Author / Producer

Date

2025-12

Publication Type

Journal Article

ETH Bibliography

yes

Citations

Web of Science:
Scopus:
Altmetric

Data

Abstract

Let (Gn)=((Vn,En)) be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that |Vn|→∞ as n→∞. We say that percolation on Gn has a sharp phase transition (as n→∞) if, as the percolation parameter crosses some critical point, the number of vertices contained in the largest percolation cluster jumps from logarithmic to linear order with high probability. We prove that percolation on Gn has a sharp phase transition unless, after passing to a subsequence, the rescaled graph-metric on Gn (rapidly) converges to the unit circle with respect to the Gromov-Hausdorff metric. We deduce that under the same hypothesis, the critical point for the emergence of a giant (i.e. linear-sized) cluster in Gn coincides with the critical point for the emergence of an infinite cluster in the Benjamini-Schramm limit of (Gn), when this limit exists.

Publication status

published

Editor

Book title

Volume

35 (6)

Pages / Article No.

1526 - 1586

Publisher

Springer

Event

Edition / version

Methods

Software

Geographic location

Date collected

Date created

Subject

Organisational unit

Notes

Funding

Related publications and datasets