English

Upper bounds on the percolation correlation length

Probability 2020-02-07 v2

Abstract

We study the size of the near-critical window for Bernoulli percolation on Zd\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/ppc2)\exp(C/|p-p_c|^2). Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on Zd\mathbb Z^d for every d2d\ge2.

Keywords

Cite

@article{arxiv.1902.03207,
  title  = {Upper bounds on the percolation correlation length},
  author = {Hugo Duminil-Copin and Gady Kozma and Vincent Tassion},
  journal= {arXiv preprint arXiv:1902.03207},
  year   = {2020}
}

Comments

21 pages, 2 figures

R2 v1 2026-06-23T07:35:59.958Z