Open Access
Translator Disclaimer
May 2012 Phase separation in random cluster models II: The droplet at equilibrium, and local deviation lower bounds
Alan Hammond
Ann. Probab. 40(3): 921-978 (May 2012). DOI: 10.1214/11-AOP646


We study the droplet that results from conditioning the planar subcritical Fortuin–Kasteleyn random cluster model on the presence of an open circuit Γ0 encircling the origin and enclosing an area of at least (or exactly) n2. We consider local deviation of the droplet boundary, measured in a radial sense by the maximum local roughness, MLR(Γ0), this being the maximum distance from a point in the circuit Γ0 to the boundary  conv(Γ0) of the circuit’s convex hull; and in a longitudinal sense by what we term maximum facet length, namely, the length of the longest line segment of which the polygon  conv(Γ0) is formed. We prove that there exists a constant c > 0 such that the conditional probability that the normalised quantity n−1/3(log n)−2/3 MLR(Γ0) exceeds c tends to 1 in the high n-limit; and that the same statement holds for n−2/3(log n)−1/3 MFL(Γ0). To obtain these bounds, we exhibit the random cluster measure conditional on the presence of an open circuit trapping high area as the invariant measure of a Markov chain that resamples sections of the circuit boundary. We analyse the chain at equilibrium to prove the local roughness lower bounds. Alongside complementary upper bounds provided in [14], the fluctuations MLR(Γ0) and MFL(Γ0) are determined up to a constant factor.


Download Citation

Alan Hammond. "Phase separation in random cluster models II: The droplet at equilibrium, and local deviation lower bounds." Ann. Probab. 40 (3) 921 - 978, May 2012.


Published: May 2012
First available in Project Euclid: 4 May 2012

zbMATH: 1271.60021
MathSciNet: MR2962083
Digital Object Identifier: 10.1214/11-AOP646

Primary: 60D05 , 82B41

Keywords: local roughness , Phase separation , random cluster model , Wulff construction

Rights: Copyright © 2012 Institute of Mathematical Statistics


Vol.40 • No. 3 • May 2012
Back to Top