A new computation of the critical point for the planar random-cluster model with $q\ge1$
Preprint
Abstract
We present a new computation of the critical value of the random-cluster model with cluster weight $q\ge 1$ on $\mathbb{Z}^2$. This provides an alternative approach to the result of Beffara and Duminil-Copin. We believe that this approach has several advantages. First, most of the proof can easily be extended to other planar graphs with sufficient symmetries. Furthermore, it invokes RSW-type arguments which are not based on self-duality. And finally, it contains a new way of applying sharp threshold results which avoid the use of symmetric events and periodic boundary conditions.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Absence of Infinite Cluster for Critical Bernoulli Percolation on SlabsCommunications on Pure and Applied Mathematics, 2016
- The self-dual point of the two-dimensional random-cluster model is critical for q ≥ 1Probability Theory and Related Fields, 2011
- Sharp thresholds for the random-cluster and Ising modelsThe Annals of Applied Probability, 2011
- Influence and sharp-threshold theorems for monotonic measuresThe Annals of Probability, 2006
- A SHORT PROOF OF THE HARRIS–KESTEN THEOREMBulletin of the London Mathematical Society, 2006
- The critical probability for random Voronoi percolation in the plane is 1/2Probability Theory and Related Fields, 2005
- Decay of Correlations in Random-Cluster ModelsCommunications in Mathematical Physics, 1997
- Greedy Lattice Animals II: Linear GrowthThe Annals of Applied Probability, 1994
- On the critical percolation probabilitiesProbability Theory and Related Fields, 1981