SearcharxivSearch

arXiv · 2605.03896

Dimer models on astroidal zig-zag graphs

Abstract

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are encoded by the inverse of the so-called Kasteleyn matrix; for a large graph, typically taken as a finite domain in a periodic graph, this inverse matrix is known explicitly only for a handful of examples. In all previously known examples, the Newton polygon -- a convex lattice polygon that classifies periodic graphs up to local moves -- is either a triangle or a quadrilateral. Our main results are the following. For any (minimal) periodic planar bipartite graph, we construct an $(n-3)$-dimensional family of finite subgraphs for which we obtain an explicit inverse Kasteleyn matrix; here $n$ is the number of sides of the Newton polygon. Their boundaries are formed by zig-zag paths and their overall shape is reminiscent of an astroid; we call them astroidal zig-zag graphs (AZ graphs). If the Newton polygon is the unit square then the corresponding AZ graph is the celebrated Aztec diamond with its size as the parameter. Our inverse Kasteleyn matrices are given by a double contour integral on the corresponding spectral curve for any Fock weighting of the graph. This includes, in particular, all periodic weightings. For periodic weightings, we asymptotically analyze the resulting inverse Kasteleyn matrices. We establish a phase separation in large AZ graphs into asymptotically frozen, rough (liquid), and smooth (gaseous) regions, and obtain an explicit parametrization of the `arctic curve'. We also compute the deterministic limit of the height function, known as the limit shape, and prove the convergence of the local dimer correlations to the translation-invariant Gibbs measure of the slope predicted by the limit shape.

Explore related subjects

Keep this discovery

BibTeXRIS

Tomas Berggren, Alexei Borodin, Terrence George. 2026-05-05. Dimer models on astroidal zig-zag graphs. https://arxiv.org/abs/2605.03896

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