Skip to content
Preprint

Non-perturbative finite connectivities in supercritical Bernoulli percolation on $\mathbb{Z}^d$ with $d\geq 3$

Oct 2026 · 0 citations · 26 references
Mathematics Physics

Abstract

We solve a longstanding problem in Bernoulli percolation: we derive sharp Ornstein--Zernike asymptotics for the probability that two distant points are connected by a finite cluster in the whole supercritical regime. Our proof has two main ingredients. First, the renewal structure from Fridbergh and Hammond (2024) yields an a priori bound on cluster volume. Second, we adapt the coarse-graining and irreducible-cluster framework of Companion, Ioffe, Velenik (2008) to finite supercritical connections. The main distinction from the subcritical analysis is that our argument does not require a separation of masses between irreducible and unrestricted finite connections. The volume bound and a modified coarse-graining construction instead provide stretched-exponential tails for the effective random-walk increments, which suffice to obtain the sharp asymptotics.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.