Dimer models on astroidal zig-zag graphs
Tomas Berggren, Alexei Borodin, Terrence George

TL;DR
This paper constructs explicit inverse Kasteleyn matrices for a new family of periodic bipartite graphs called astroidal zig-zag graphs, enabling detailed analysis of their dimer models and phase behavior.
Contribution
It introduces a novel class of graphs with explicit inverse Kasteleyn matrices and analyzes their phase separation and limit shape in the dimer model.
Findings
Explicit inverse Kasteleyn matrices for AZ graphs are given by double contour integrals.
AZ graphs exhibit phase separation into frozen, rough, and smooth regions.
The arctic curve and limit shape are explicitly parametrized and proven to converge.
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 -dimensional family of finite subgraphs for which we obtain an explicit inverse Kasteleyn matrix; here is the number of sides of the Newton polygon. Their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
