SearcharxivSearch

arXiv · 2306.12560

Extrema of 3D Potts interfaces

Abstract

The interface between the plus and minus phases in the low temperature 3D Ising model has been intensely studied since Dobrushin's pioneering works in the early 1970's established its rigidity. Advances in the last decade yielded the tightness of the maximum of the interface of this Ising model on the cylinder of side length $n$, around a mean that is asymptotically $c\log n$ for an explicit $c$ (temperature dependent). In this work, we establish analogous results for the 3D Potts and random cluster (FK) models. Compared to 3D Ising, the Potts model and its lack of monotonicity form obstacles for existing methods, calling for new proof ideas, while its interfaces (and associated extrema) exhibit richer behavior. We show that the maxima and minima of the interface bounding the blue component in the 3D Potts interface, and those of the interface bounding the bottom component in the 3D FK model, are governed by 4 different large deviation rates, whence the corresponding global extrema feature 4 distinct constants $c$ as above. Due to the above obstacles, our methods are initially only applicable to 1 of these 4 interface extrema, and additional ideas are needed to recover the other 3 rates given the behavior of the first one.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph Chen, Eyal Lubetzky. 2023-06-21. Extrema of 3D Potts interfaces. https://arxiv.org/abs/2306.12560

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