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 . 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 . Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on for every .
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