On the derivation of mean-field percolation critical exponents from the triangle condition
arXiv:2106.06400 · doi:10.1007/s10955-022-02967-7
Abstract
We give a new derivation of mean-field percolation critical behaviour from the triangle condition that is quantitatively much better than previous proofs when the triangle diagram is large. In contrast to earlier methods, our approach continues to yield bounds of reasonable order when the triangle diagram is unbounded but diverges slowly as , as is expected to occur in percolation on at the upper-critical dimension . Indeed, we show in particular that if the triangle diagram diverges polylogarithmically as then mean-field critical behaviour holds to within a polylogarithmic factor. We apply the methods we develop to deduce that for long-range percolation on the hierarchical lattice, mean-field critical behaviour holds to within polylogarithmic factors at the upper-critical dimension. As part of the proof, we introduce a new method for comparing diagrammatic sums on general transitive graphs that may be of independent interest.
arXiv comment36 pages, 3 figures. V2: Fixed a minor error. V3: Various minor fixes and improvements; content reorganized. Accepted version, to appear in JSP
References in corpus (8)
- The Alexander-Orbach conjecture holds in high dimensions
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Introduction to a renormalisation group method
- Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
- Critical two-point functions for long-range statistical-mechanical models in high dimensions
- New critical exponent inequalities for percolation and the random cluster model
- The critical two-point function for long-range percolation on the hierarchical lattice