Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
From MaRDI portal
(Redirected from Publication:888932)
Abstract: We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of a sequence of finite graphs converging to L. This allows us to express the monomer-dimer free energy of L in terms of the measure. Exploiting an analytic advantage of the matching measure over the Mayer series then leads to new, rigorous bounds on the monomer-dimer free energies of various Euclidean lattices. While our estimates use only the computational data given in previous papers, they improve the known bounds significantly.
Recommendations
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- On the validations of the asymptotic matching conjectures
- Atoms of the matching measure
- \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3248840 (Why is no real title available?)
- scientific article; zbMATH DE number 3257906 (Why is no real title available?)
- A Lower Bound for the Monomer-Dimer Problem
- A positivity property of the dimer entropy of graphs
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- Benjamini-Schramm continuity of root moments of graph polynomials
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Borel oracles. An analytical approach to constant-time algorithms
- Dimer problem in statistical mechanics-an exact result
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
- Matchings in Benjamini-Schramm convergent graph sequences
- New lower bounds on the self-avoiding-walk connective constant
- On the Distribution of the Number of Successes in Independent Trials
- Sequential cavity method for computing free energy and surface pressure
- Sofic groups and diophantine approximation
- Statistical Mechanics of Dimers on a Plane Lattice
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- The expected eigenvalue distribution of a large regular graph
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Theory of monomer-dimer systems
- Upper Bounds for the Connective Constant of Self-Avoiding Walks
Cited in
(8)- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Atoms of the matching measure
- Matchings in vertex-transitive bipartite graphs
- Chromatic roots and limits of dense graphs
- On the distribution of eigenvalues of increasing trees
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- Statistical Matching Theory
- Evaluations of Tutte polynomials of regular graphs
This page was built for publication: Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888932)
