Work

An explicit rate for the critical one-arm probability of Bernoulli percolation

Year: 2026
Type: preprint
Abstract: Let π(n) be the probability that, in critical Bernoulli percolation on ℤ^d, the origin is joined by an open path to the boundary of the box [−n,n]^d. That π(n)→0, that is, that there is no infinite cluster at the critical point, was recently proved for bond and site percolation in every dimension d≥3, by arguments that proceed by contradiction and give no rate. We prove that for bond and site percolation in every dimension d≥3, π(n) ≤ (1−c₀)^⌊(log* n+2−j₁)/3⌋, with explicit constants c₀=c₀(d)>0 and j₁=j₁(d), where j₁=5 for 3≤d≤10; thus π(n) ≤ exp(−c log* n) for some c=c(d)>0 and all large n. This is new for bond percolation in 3≤d≤10 and for site percolation below the lace-expansion range; for bond percolation in d≥11, π(n) ≍ n^(−2) is known. We also obtain an explicit modulus of continuity of the percolation density at p_c and a tail bound for the critical cluster. The proof reads a recent renormalization proof on ℤ³ as a finite-size criterion: an explicit event in a finite box, if it has probability close to one at p, forces percolation at some q<p. At p_c the event must therefore fail with a fixed probability, and its failures in disjoint annuli are independent. The scales of the criterion grow doubly exponentially, hence the log* rate. We show that this is the limit of the method, locate the two steps responsible, both in the extension estimate, and state what would give (log n)^(−c) or a polynomial bound.
Author: Pei, Yan Ru
Language: English
Open Access status: green
OpenAlex ID: W7233587212
Cites:
Cited by:
Related to: