SearcharxivSearch

arXiv · 2306.01527

Delocalisation and continuity in 2D: loop O(2), six-vertex, and random-cluster models

Abstract

We prove the existence of macroscopic loops in the loop O(2) model with $\frac12\leq x^2\leq 1$ or, equivalently, delocalisation of the associated integer-valued Lipschitz function on the triangular lattice. This settles one side of the conjecture of Fan, Domany, and Nienhuis (1970s-80s) that $x^2 = \frac12$ is the critical point. We also prove delocalisation in the six-vertex model with $0<a,\,b\leq c\leq a+b$. This yields a new proof of continuity of the phase transition in the random-cluster and Potts models in two dimensions for $1\leq q\leq 4$ relying neither on integrability tools (parafermionic observables, Bethe Ansatz), nor on the Russo-Seymour-Welsh theory. Our approach goes through a novel FKG property required for the non-coexistence theorem of Zhang and Sheffield, which is used to prove delocalisation all the way up to the critical point. We also use the $\mathbb T$-circuit argument in the case of the six-vertex model. Finally, we extend an existing renormalisation inequality in order to quantify the delocalisation as being logarithmic, in the regimes $\frac12\leq x^2\leq 1$ and $a=b\leq c\leq a+b$. This is consistent with the conjecture that the scaling limit is the Gaussian free field.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Glazman, Piet Lammers. 2023-10-27. Delocalisation and continuity in 2D: loop O(2), six-vertex, and random-cluster models. https://arxiv.org/abs/2306.01527

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