A lower bound on the two-arms exponent for critical percolation on the lattice
classification
🧮 math.PR
keywords
boundexponentlatticelowerpercolationtwo-armsaizenmancluster
read the original abstract
We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the two-arms exponent is larger than or equal to $1/2$. We improve slightly this lower bound in any dimension $d\geq2$. Next, starting only with the hypothesis that $\theta(p)>0$, without using the slab technology, we derive a quantitative estimate establishing long-range order in a finite box.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.