New critical exponent inequalities for percolation and the random cluster model

Abstract

We apply a variation on the methods of Duminil-Copin, Raoufi, and Tassion to establish a new differential inequality applying to both Bernoulli percolation and the Fortuin-Kasteleyn random cluster model. This differential inequality has a similar form to that derived for Bernoulli percolation by Menshikov but with the important difference that it describes the distribution of the volume of a cluster rather than of its radius. We apply this differential inequality to prove the following: The critical exponent inequalities $\gamma \le \delta -1$ and $\Delta \le \gamma +1$ hold for percolation and the random cluster model on any transitive graph. These inequalities are new even in the context of Bernoulli percolation on ${\mathbb{Z}}^d$, and are saturated in mean-field for Bernoulli percolation and for the random cluster model with $q\in [1,2)$. The volume of a cluster has an exponential tail in the entire subcritical phase of the random cluster model on any transitive graph. This proof also applies to infinite-range models, where the result is new even in the Euclidean setting.

20 pages. V2: Several minor corrections

Cited by in corpus (7)

• Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on ${\mathbb{Z}}^d$
• On the derivation of mean-field percolation critical exponents from the triangle condition
• Sharp asymptotics of correlation functions in the subcritical long-range random-cluster and Potts models
• On the two-point function of the Potts model in the saturation regime
• Isoperimetric lower bounds for critical exponents for long-range percolation
• Sharpness of the Phase Transition for the Orthant Model
• Homology-changing percolation transitions on finite graphs