SearcharxivSearch

arXiv · 2412.11708

On loops in the complement to dimers

Abstract

We consider ergodic translation-invariant Gibbs measures for the dimer model (i.e. perfect matchings) on the hexagonal lattice. The complement to a dimer configuration is a fully-packed loop configuration: each vertex has degree two. This is also known as the loop $O(1)$ model at $x=\infty$. We show that, if the measure is non-frozen, then it exhibits either infinitely many loops around every face or a unique bi-infinite path. Our main tool is the flip (or XOR) operation: if a hexagon contains exactly three dimers, one can replace them by the other three edges. Classical results in the dimer theory imply that such hexagons appear with a positive density. Up to some extent, this replaces the finite-energy property and allows to make use of tools from the percolation theory, in particular the Burton--Keane argument, to exclude existence of more than one bi-infinite path.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Glazman, Lucas Rey. 2024-12-16. On loops in the complement to dimers. https://arxiv.org/abs/2412.11708

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