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

DOI10.1007/s10955-015-1309-7zbMath1327.82034arXiv1405.6740OpenAlexW1574882396MaRDI QIDQ888932

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

Publication date: 5 November 2015

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

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

zbMATH Keywords

self-avoiding walksmatching polynomialBenjamini-Schramm convergencemonomer-dimer model

Mathematics Subject Classification ID

Statistical mechanics of polymers (82D60) 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)

Related Items

Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Evaluations of Tutte polynomials of regular graphs, Matchings on trees and the adjacency matrix: A determinantal viewpoint, On the distribution of eigenvalues of increasing trees, Statistical Matching Theory, Matchings in vertex-transitive bipartite graphs, Chromatic roots and limits of dense graphs, Atoms of the matching measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Benjamini-Schramm continuity of root moments of graph polynomials
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Sequential cavity method for computing free energy and surface pressure
• The expected eigenvalue distribution of a large regular graph
• A positivity property of the dimer entropy of graphs
• New lower bounds on the self-avoiding-walk connective constant
• Theory of monomer-dimer systems
• Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
• Matchings in Benjamini–Schramm convergent graph sequences
• The statistics of dimers on a lattice
• Statistical Mechanics of Dimers on a Plane Lattice
• Sofic groups and diophantine approximation
• Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
• Borel oracles. An analytical approach to constant-time algorithms
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Dimer problem in statistical mechanics-an exact result
• On the Distribution of the Number of Successes in Independent Trials
• A Lower Bound for the Monomer-Dimer Problem