SearcharxivSearch

arXiv · math/0610100

Fluctuation theory of connectivities for subcritical random cluster models

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.

Explore related subjects

Keep this discovery

BibTeXRIS

Massimo Campanino, Dmitry Ioffe, Yvan Velenik. 2008-08-26. Fluctuation theory of connectivities for subcritical random cluster models. https://doi.org/10.1214/07-aop359

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR