Abstract
We develop a fluctuation theory of connectivities for subcritical random cluster models. The theory is based on a comprehensive nonperturbative probabilistic description of long connected clusters in terms of essentially one-dimensional chains of irreducible objects. Statistics of local observables, for example, displacement, over such chains obey classical limit laws, and our construction leads to an effective random walk representation of percolation clusters. The results include a derivation of a sharp Ornstein–Zernike type asymptotic formula for two point functions, a proof of analyticity and strict convexity of inverse correlation length and a proof of an invariance principle for connected clusters under diffusive scaling. In two dimensions duality considerations enable a reformulation of these results for supercritical nearest-neighbor random cluster measures, in particular, for nearest-neighbor Potts models in the phase transition regime. Accordingly, we prove that in two dimensions Potts equilibrium crystal shapes are always analytic and strictly convex and that the interfaces between different phases are always diffusive. Thus, no roughening transition is possible in the whole regime where our results apply. Our results hold under an assumption of exponential decay of finite volume wired connectivities [assumption (1.2) below] in rectangular domains that is conjectured to hold in the whole subcritical regime; the latter is known to be true, in any dimensions, when q=1, q=2, and when q is sufficiently large. In two dimensions assumption (1.2) holds whenever there is an exponential decay of connectivities in the infinite volume measure. By duality, this includes all supercritical nearest-neighbor Potts models with positive surface tension between ordered phases.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.