Upper bounds on the percolation correlation length

2019/02/08 by Hugo Duminil‐Copin, Gady Kozma, Duminil-Copin, Hugo +3 · 3 citations
Mathematics · #60K35 (primary) #68Q87 (secondary) #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Random Matrices and Applications #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1902.03207

openalex publication_date 2019/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the size of the near-critical window for Bernoulli percolation on \mathbb Z^d. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded from above by exp(C/|p-p_c|²). Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on \mathbb Z^d for every d≥2.

Cited by

• A coarse-graining theory for elliptic operators and homogenization in high contrast
• Supercritical phase of the random connection model
• Crossings and diffusion in Poisson driven marked random connection models

Related

• Power-law bounds for critical long-range percolation below the\n upper-critical dimension
• A new proof of the sharpness of the phase transition for Bernoulli\n percolation on mathbb Z^d
• Upper bounds for critical probabilities in Bernoulli Percolation models
• Sharpness of Bernoulli percolation via couplings
• Asymptotics for 2D critical and near-critical first-passage percolation