Isoperimetric lower bounds for critical exponents for long-range percolation
arXiv:2204.12410 · doi:10.1214/22-AIHP1342
Abstract
We study independent long-range percolation on where the vertices and are connected with probability for . Provided the critical exponents and defined by and exist, where is the cluster containing the origin, we show that \begin{equation*} δ\geq \frac{d+(α\wedge 1)}{d-(α\wedge 1)} \ \text{ and } \ 2-η\geq α\wedge 1 \text. \end{equation*} The lower bound on is believed to be sharp for and for , whereas the lower bound on is sharp for , and for for , and is not believed to be sharp otherwise. Our main tool is a connection between the critical exponents and the isoperimetry of cubes inside .
13 pages, 2 figures
References in corpus (4)
- On the scaling of the chemical distance in long-range percolation models
- Critical random graphs: Diameter and mixing time
- Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
- Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on