SearcharxivSearch

arXiv · 2409.06079

Logarithmic delocalization of low temperature 3D Ising and Potts interfaces above a hard floor

Abstract

We study the entropic repulsion of the low temperature 3D Ising and Potts interface in an $n\times n \times n$ box with blue boundary conditions on its bottom face (the hard floor), and red boundary conditions on its other five faces. For Ising, Frohlich and Pfister proved in 1987 that the typical interface height above the origin diverges (non-quantitatively), via correlation inequalities special to the Ising model; no such result was known for Potts. We show for both the Ising and Potts models that the entropic repulsion fully overcomes the potentially attractive interaction with the floor, and obtain a logarithmically diverging lower bound on the typical interface height. This is complemented by a conjecturally sharp upper bound of $\lfloor \xi^{-1}\log n\rfloor$ where $\xi$ is the rate function for a point-to-plane non-red connection under the infinite volume red measure. The proof goes through a coupled random-cluster interface to overcome the potential attractive interaction with the boundary, and a coupled fuzzy Potts model to reduce the upper bound to a simpler setting where the repulsion is attained by conditioning a no-floor interface to lie in the upper half-space.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph Chen, Reza Gheissari, Eyal Lubetzky. 2024-09-09. Logarithmic delocalization of low temperature 3D Ising and Potts interfaces above a hard floor. https://arxiv.org/abs/2409.06079

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