Dimer model and holomorphic functions on t-embeddings of planar graphs
Dmitry Chelkak, Benoît Laslier, Marianna Russkikh
备注：
79 pages, 17 figures. Changes in this version: assumption Exp-Fat clarified, proof of Proposition 6.4 extended, several figures redrawn/added, throughout editing (+ layout changed and Appendix is renamed as Section 8)
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite planar graphs; t-embeddings also appeared under the name Coulomb gauges in a recent paper arXiv:1810.05616. We argue that this framework is particularly relevant for the analysis of scaling limits of the height fluctuations in the corresponding dimer models. In particular, it unifies both Kenyon's interpretation of dimer observables as derivatives of harmonic functions on T-graphs and the notion of s-holomorphic functions originated in Smirnov's work on the critical Ising model. We develop an a priori regularity theory for such functions and provide a meta-theorem on convergence of the height fluctuations to the Gaussian Free Field. We also discuss how several more standard discretizations of complex analysis fit this general framework.
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can be used to study the homotopy classes (relative to a fixed set of faces) of loops in the double dimer model on a planar graph. As an application we prove that, in the scaling limit of the "uniform" double-dimer model on ${\mathbb Z}^2$ (or on any other bipartite planar graph conformally approximating $\mathbb C$), the loops are conformally invariant. As othe…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees on the corresponding Markov chain. The tilings correspond to harmonic functions on the Markov chain and to ``discrete analytic functions'' on the bipartite graph. The equivalence is extended to infinite periodic graphs, and we class…
We prove the existence of a limit shape for the dimer model on planar periodic bipartite graphs with an arbitrary fundamental domain and arbitrary periodic weights. This proof is based on a variational principle that uses the locality of the model and the compactness of the space of states.
In this paper, we introduce a family of observables for the dimer model on a bi-periodic bipartite planar graph, called pattern density fields. We study the scaling limit of these objects for liquid and gaseous Gibbs measures of the dimer model, and prove that they converge to a linear combination of a derivative of the Gaussian massless free field and an independent white noise.
We relate the planar random current representation introduced by Griffiths, Hurst and Sherman to the dimer model. More precisely, we provide a measure-preserving map between double random currents (obtained as the sum of two independent random currents) on a planar graph and dimers on an associated bipartite graph. We also construct a nesting field for the double random current, which, under this map, corresponds to the height function of the dimer model. As applications, we provide an alternative derivation of some of the bozonization rules obtained recently by Dubédat, and show that the spon…
This is the second paper in the series devoted to the study of the dimer model on t-embeddings of planar bipartite graphs. We introduce the notion of perfect t-embeddings and assume that the graphs of the associated origami maps converge to a Lorentz-minimal surface $\mathrm{S}_ξ$ as $δ\to 0$. In this setup we prove (under very mild technical assumptions) that the gradients of the height correlation functions converge to those of the Gaussian Free Field defined in the intrinsic metric of the surface $\mathrm{S}_ξ$. We also formulate several open questions motivated by our work.
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for "tripartite" pairings of the nodes, the probability can be computed as a Pfaffian in the entries of the Dirichlet-to-Neumann matrix (discrete Hilbert transform) of the graph. These formulas generalize the determinant formulas given by Curtis, Ingerman, and Morrow, and by Fomin, for parallel pa…
The dimer model on a planar bipartite graph can be viewed as a random surface measure. We study these fluctuations for a dimer model on the square grid with two different classes of weights and provide a condition for their equivalence. In the thermodynamic limit and scaling window, these height fluctuations are shown to be non-Gaussian. They are also rotationally invariant for a certain choice of weights. Finally, we show that the height difference between any two points is Gaussian for a specific choice of weights.
An isoradial graph is a planar graph in which each face is inscribable into a circle of common radius. We study the 2-dimensional perfect matchings on a bipartite isoradial graph, obtained from the union of an isoradial graph and its interior dual graph. Using the isoradial graph to approximate a simply-connected domain bounded by a simple closed curve, by letting the mesh size go to zero, we prove that in the scaling limit, the distribution of height is conformally invariant and converges to a Gaussian free field.
We present a general result which shows that the winding of the branches in a uniform spanning tree on a planar graph converge in the limit of fine mesh size to a Gaussian free field. The result holds true assuming only convergence of simple random walk to Brownian motion and a Russo-Seymour-Welsh type crossing estimate. As an application, we prove universality of the fluctuations of the height function associated to the dimer model, in several situations. This includes the case of lozenge tilings with boundary conditions lying in a plane, and Temperleyan domains in isoradial graphs (recoverin…
We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar bipartite graph $G$ with special vertices, called nodes, on the outer face, the double-dimer model is formed by the superposition of a uniformly random dimer configuration (perfect matching) of $G$ together with a random dimer configuration of the graph formed from $G$ by deleting the nodes. The double-dimer configuration consists of loops, doubled edges, a…
The dimer model is an exactly solvable model of planar statistical mechanics. In its critical phase, various aspects of its scaling limit are known to be described by the Gaussian free field. For periodic graphs, criticality is an algebraic condition on the spectral curve of the model, determined by the edge weights; isoradial graphs provide another class of critical dimer models, in which the edge weights are determined by the local geometry. In the present article, we consider another class of graphs: general Temperleyan graphs, i.e. graphs arising in the (generalized) Temperley bijection be…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs, this height function is known to converge in the fine mesh limit to a Gaussian free field, following in particular Kenyon's work. In the present article, we study the asymptotics of smoothed and local field observables from the point of view of families of Cauchy-Riemann operators and their determinants. This allows in particular to obtain a functional invarian…
We use the periodic Schur process, introduced in arXiv:math/0601019v1, to study the random height function of lozenge tilings (equivalently, dimers) on an infinite cylinder distributed under two variants of the $q^{\operatorname{vol}}$ measure. Under the first variant, corresponding to random cylindric partitions, the height function converges to a deterministic limit shape and fluctuations around it are given by the Gaussian free field in the conformal structure predicted by the Kenyon-Okounkov conjecture. Under the second variant, corresponding to an unrestricted dimer model on the cylinder,…
A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called "dimers" and longer ones called "contours". Then the rotor-router walk performing an Euler tour on the graph generates a sequence of dimers and contours which exhibits both random and regular properties. Imposing initial conditions randomly chosen from the uniform distribution we calculate expected numbers of dimers and contours and correlation between them at …
We prove a quantitative Russo-Seymour-Welsh (RSW) type result for random walks on two natural examples of random planar graphs: the supercritical percolation cluster in the square lattice and the Poisson Voronoi triangulation in the plane. More precisely, we prove that the probability that a simple random walk crosses a rectangle in the hard direction with uniformly positive probability is stretched exponentially likely in the size of the rectangle. As an application we prove a near optimal decorrelation result for uniform spanning trees for such graphs. This is the key missing step in this se…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of the different possible node connections in a grove. These probabilities only depend on boundary measurements of the graph and not on the actual graph structure, i.e., the probabilities can be expressed as functions of the pairwise electrical resistances between the nodes, or equivalently, as functions of the Dirichlet-to-Neumann operator (or response matrix…
