Related papers: The multinomial dimer model
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
After having introduced the notion of universality in statistical mechanics and its importance for our comprehension of the macroscopic behavior of interacting systems, I review recent progress in the understanding of the scaling limit of…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
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…
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…
Standard statistical mechanical or condensed matter arguments tell us that bulk properties of a physical system do not depend too much on boundary conditions. Random tilings of large regions provide counterexamples to such intuition, as…
We analyze the partition function of the dimer model on an $\mathcal{M} \times \mathcal{N}$ triangular lattice wrapped on torus obtained by Fendley, Moessner and Sondhi [Phys. Rev. B \textbf{66}, 214513 (2002)]. From a finite-size analysis…
We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can…
The dimer (monomer-dimer) model deals with weighted enumeration of perfect matchings (matchings). The monopole-dimer model is a signed variant of the monomer-dimer model whose partition function is a determinant. In 1999, Lu and Wu…
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…
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.…
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 consider the hyperuniform model of d-dimensional integer lattice perturbed by independent random variables and we investigate the large scale asymptotic fluctuations of smoothed versions of the usual counting statistics, specifically of…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…
Rail-yard graphs are a general class of graphs introduced in \cite{bbccr} on which the random dimer coverings form Schur processes. We study asymptotic limits of random dimer coverings on rail yard graphs with free boundary conditions on…
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 hard dimers on dynamical lattices in arbitrary dimensions using a random tensor model. The set of lattices corresponds to triangulations of the d-sphere and is selected by the large N limit. For small enough dimer activities, the…
In this paper, we study a double scaling limit of two multi-matrix models: the $U(N)^2 \times O(D)$-invariant model with all quartic interactions and the bipartite $U(N) \times O(D)$-invariant model with tetrahedral interaction ($D$ being…
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…