Power-law bounds for critical long-range percolation below the upper-critical dimension

From MaRDI portal
Publication:2052709




Abstract: We study long-range Bernoulli percolation on mathbbZd in which each two vertices x and y are connected by an edge with probability . It is a theorem of Noam Berger (CMP, 2002) that if 0<alpha<d then there is no infinite cluster at the critical parameter . We give a new, quantitative proof of this theorem establishing the power-law upper bound [ mathbf{P}_{�eta_c}�igl(|K|geq n�igr) leq C n^{-(d-alpha)/(2d+alpha)} ] for every ngeq1, where K is the cluster of the origin. We believe that this is the first rigorous power-law upper bound for a Bernoulli percolation model that is neither planar nor expected to exhibit mean-field critical behaviour. As part of the proof, we establish a universal inequality implying that the maximum size of a cluster in percolation on any finite graph is of the same order as its mean with high probability. We apply this inequality to derive a new rigorous hyperscaling inequality (2eta)(delta+1)leqd(delta1) relating the cluster-volume exponent delta and two-point function exponent eta.



Cites work


Cited in
(21)






This page was built for publication: Power-law bounds for critical long-range percolation below the upper-critical dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052709)