相关论文: Asymptotics of dimer coverings on free boundary ra…

We study asymptotic limit of random pure dimer coverings on rail yardgraphs when the mesh sizes of the graphs go to 0. Each pure dimer covering correspondsto a sequence of interlacing partitions starting with an empty partition and ending…

We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…

We study perfect matchings on the rail-yard graphs in which the right boundary condition is given by the empty partition and the left boundary can be divided into finitely many alternating line segments where all the vertices along each…

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,…

We investigate the asymptotic behavior of perfect matchings on rail-yard graphs with doubly free boundary conditions and Jack weights. While a special case of this model reduces to the half space Macdonald process with Jack weights…

The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop…

We consider dimer models on graphs which are bipartite, periodic and satisfy a geometric condition called {\em isoradiality}, defined in \cite{Kenyon3}. We show that the scaling limit of the height function of any such dimer model is…

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}}$…

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…

We study the dimer model on subgraphs of the square lattice in which vertices on a prescribed part of the boundary (the free boundary) are possibly unmatched. Each such unmatched vertex is called a monomer and contributes a fixed…

We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…

We study limit shapes for dimer models on domains of the hexagonal lattice with free boundary conditions. This is equivalent to the large deviation phenomenon for a random stepped surface over domains fixed only at part of the boundary.

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…

The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…

We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…

In this paper we investigate the height field of a dimer model/random domino tiling on the plane at a smooth-rough (i.e. gas-liquid) transition. We prove that the height field at this transition has two-point correlation functions which…

In this work we study the variational problem associated to dimer models, a class of models from integrable probability and statistical mechanics in dimension two which have been the focus of intense research efforts over the last decades.…

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…

We consider the dimer model on a bipartite graph embedded into a locally flat Riemann surface with conical singularities and satisfying certain geometric conditions in the spirit of the work of [Chelkak, Laslier and Russkikh, Proceedings of…

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…