Related papers: Disordered Monomer-Dimer model on Cylinder graphs
We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…
We study the dimer model on the square grid, with quenched random edge weights. Randomness is chosen to have a layered structure, similar to that of the celebrated McCoy-Wu disordered Ising model. Disorder has a highly non-trivial effect…
Consider a finite graph $G=(V(G),E(G))$ and two continuous weight distributions $\omega$ and $\xi$, for which we only assume that $\xi$ is lower bounded. Next, independently draw weights $(w(e))_{e \in E(G)}$ with distribution $\omega$ on…
This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from 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…
The correlation functions of an arbitrary number of boundary monomers in the system of close-packed dimers on the square lattice are computed exactly in the scaling limit. The equivalence of the 2n-point correlation functions with those of…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
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 continue the discussion of the fermion models on graphs that started in the first paper of the series. Here we introduce a Graphical Gauge Model (GGM) and show that : (a) it can be stated as an average/sum of a determinant defined on the…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
Independent random monomer activities are considered on a mean-feld monomer-dimer model. Under very general conditions on the randomness the model is shown to have a self-averaging pressure density that obeys a solvable variational…
We prove a distributional limit theorem conjectured in [Journal of Statistical Physics 174, No. 6, 1372-1403 (2019)] for partition functions defining models of directed polymers on diamond hierarchical graphs with disorder variables placed…
A collection of rigorous results for a class of mean-field monomer-dimer models is presented. It includes a Gaussian representation for the partition function that is shown to considerably simplify the proofs. The solutions of the quenched…
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…
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…
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…
Following the recent work of Sznitman (arXiv:0805.4516), we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form G_N x Z, where G_N is a large finite connected weighted graph, and relate it to…
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 present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…