scholarly journals Planar random-cluster model: fractal properties of the critical phase

Author(s):  
Hugo Duminil-Copin ◽  
Ioan Manolescu ◽  
Vincent Tassion

AbstractThis paper is studying the critical regime of the planar random-cluster model on $${\mathbb {Z}}^2$$ Z 2 with cluster-weight $$q\in [1,4)$$ q ∈ [ 1 , 4 ) . More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend only on their extremal lengths. They imply in particular that any fractal boundary is touched by macroscopic clusters, uniformly in its roughness or the configuration on the boundary. Additionally, they imply that any sub-sequential scaling limit of the collection of interfaces between primal and dual clusters is made of loops that are non-simple. We also obtain a number of properties of so-called arm-events: three universal critical exponents (two arms in the half-plane, three arms in the half-plane and five arms in the bulk), quasi-multiplicativity and well-separation properties (even when arms are not alternating between primal and dual), and the fact that the four-arm exponent is strictly smaller than 2. These results were previously known only for Bernoulli percolation ($$q = 1$$ q = 1 ) and the FK-Ising model ($$q = 2$$ q = 2 ). Finally, we prove new bounds on the one, two and four-arm exponents for $$q\in [1,2]$$ q ∈ [ 1 , 2 ] , as well as the one-arm exponent in the half-plane. These improve the previously known bounds, even for Bernoulli percolation.

2006 ◽  
Vol 51 (15) ◽  
pp. 3091-3096 ◽  
Author(s):  
Z.D. Wei ◽  
H.B. Ran ◽  
X.A. Liu ◽  
Y. Liu ◽  
C.X. Sun ◽  
...  

2016 ◽  
Vol 681 ◽  
pp. 012014
Author(s):  
Martin Weigel ◽  
Eren Metin Elci ◽  
Nikolaos G. Fytas

2019 ◽  
Vol 30 (02n03) ◽  
pp. 1950009
Author(s):  
Hai Lin ◽  
Jingcheng Wang

In this paper, we develop an analytical framework and analyze the percolation properties of a random network by introducing statistical physics method. To adequately apply the statistical physics method on the research of a random network, we establish an exact mapping relation between a random network and Ising model. Based on the mapping relation and random cluster model (RCM), we obtain the partition function of the random network and use it to compute the size of the giant component and the critical value of the present probability. We extend this approach to investigate the size of remaining giant component and the critical phenomenon in the random network which is under a certain random attack. Numerical simulations show that our approach is accurate and effective.


2011 ◽  
Vol 852 (1) ◽  
pp. 149-173 ◽  
Author(s):  
Gesualdo Delfino ◽  
Jacopo Viti

2009 ◽  
Vol 80 (3) ◽  
Author(s):  
Youjin Deng ◽  
Xiaofeng Qian ◽  
Henk W. J. Blöte

2016 ◽  
Vol 64 (8) ◽  
pp. 3563-3575 ◽  
Author(s):  
Xuesong Cai ◽  
Xuefeng Yin ◽  
Xiang Cheng ◽  
Antonio Perez Yuste

2017 ◽  
Vol 170 (1) ◽  
pp. 22-61 ◽  
Author(s):  
Andrea Collevecchio ◽  
Eren Metin Elçi ◽  
Timothy M. Garoni ◽  
Martin Weigel

Sign in / Sign up

Export Citation Format

Share Document