Search arXivSearch

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

Explore connections, maps & timelines

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

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR