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

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24263987
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Yan Ru Pei
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

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

Yan Ru Pei
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon