Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy

DOI10.1007/S10955-015-1309-7zbMATH Open1327.82034arXiv1405.6740OpenAlexW1574882396MaRDI QIDQ888932FDOQ888932

Authors: Miklós Abért, Péter Csikvári, Tamás Hubai 

Publication date: 5 November 2015

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1405.6740

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

zbMATH Keywords

matching polynomialBenjamini-Schramm convergencemonomer-dimer modelself-avoiding walks

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of polymers (82D60)

Cites Work

• Theory of monomer-dimer systems
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• Dimer problem in statistical mechanics-an exact result
• Title not available (Why is that?)
• A Lower Bound for the Monomer-Dimer Problem
• Title not available (Why is that?)
• Sequential cavity method for computing free energy and surface pressure
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The expected eigenvalue distribution of a large regular graph
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• Benjamini-Schramm continuity of root moments of graph polynomials
• Sofic groups and diophantine approximation
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Borel oracles. An analytical approach to constant-time algorithms
• A positivity property of the dimer entropy of graphs
• Matchings in Benjamini-Schramm convergent graph sequences
• On the Distribution of the Number of Successes in Independent Trials
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Title not available (Why is that?)
• New lower bounds on the self-avoiding-walk connective constant
• Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
• 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
• On the distribution of eigenvalues of increasing trees
• Chromatic roots and limits of dense graphs
• 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)