SearcharxivSearch

arXiv · 1001.1527

Phase separation in random cluster models I: uniform upper bounds on local deviation

Abstract

This is the first in a series of three papers that addresses the behaviour of the droplet that results, in the percolating phase, from conditioning the Fortuin-Kasteleyn planar random cluster model on the presence of an open dual circuit Gamma_0 encircling the origin and enclosing an area of at least (or exactly) n^2. (By the Fortuin-Kasteleyn representation, the model is a close relative of the droplet formed by conditioning the Potts model on an excess of spins of a given type.) We consider local deviation of the droplet boundary, measured in a radial sense by the maximum local roughness, MLR(Gamma_0), this being the maximum distance from a point in the circuit Gamma_0 to the boundary of the circuit's convex hull; and in a longitudinal sense by what we term maximum facet length, MFL(Gamma_0), namely, the length of the longest line segment of which the boundary of the convex hull is formed. The principal conclusion of the series of papers is the following uniform control on local deviation: that there are positive constants c and C such that the conditional probability that the normalised quantity n^{-1/3}\big(\log n \big)^{-2/3} MLR(Gamma_0) lies in the interval [c,C] tends to 1 in the high n-limit; and that the same statement holds for n^{-2/3}\big(\log n \big)^{-1/3} MFL(Gamma_0). In this way, we confirm the anticipated n^{1/3} scaling of maximum local roughness, and provide a sharp logarithmic power-law correction. This local deviation behaviour occurs by means of locally Gaussian effects constrained globally by curvature, and we believe that it arises in a range of radially defined stochastic interface models, including several in the Kardar-Parisi-Zhang universality class. This paper is devoted to proving the upper bounds in these assertions, and includes a heuristic overview of the surgical technique used in the three papers.

Explore related subjects

Keep this discovery

BibTeXRIS

Alan Hammond. 2011-06-12. Phase separation in random cluster models I: uniform upper bounds on local deviation. https://arxiv.org/abs/1001.1527

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