Statistical Matching Theory
From MaRDI portal
Publication:3295266
DOI10.1007/978-3-662-59204-5_5zbMath1443.05099OpenAlexW3005332000MaRDI QIDQ3295266
Publication date: 8 July 2020
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-59204-5_5
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
- Counting in two-spin models on \(d\)-regular graphs
- Matchings in vertex-transitive bipartite graphs
- Chromatic roots and limits of dense graphs
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- Benjamini-Schramm continuity of root moments of graph polynomials
- Gibbs measures and phase transitions on sparse random graphs
- The maximum number of perfect matchings in graphs with a given degree sequence
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- On the number of matchings in regular graphs
- Sequential cavity method for computing free energy and surface pressure
- Spanning trees in regular graphs
- The number of matchings in random regular graphs and bipartite graphs
- The expected eigenvalue distribution of a large regular graph
- Alternating-sign matrices and domino tilings. I
- Counting 1-factors in regular bipartite graphs
- A positivity property of the dimer entropy of graphs
- The matching energy of random graphs
- Factor models on locally tree-like graphs
- The replica symmetric solution for Potts models on \(d\)-regular graphs
- Dimers and amoebae
- Theory of monomer-dimer systems
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Matchings in Benjamini–Schramm convergent graph sequences
- The statistics of dimers on a lattice
- On Leonid Gurvits’s Proof for Permanents
- Symmetric Random Walks on Groups
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
- Counting matchings in irregular bipartite graphs and random lifts
- Left and right convergence of graphs with bounded degree
- On the Number of Perfect Matchings in Random Lifts
- Belief Propagation, Bethe Approximation and Polynomials
- Dimer problem in statistical mechanics-an exact result
- Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
- Independent sets, matchings, and occupancy fractions
- On the Permanent of a Doubly Stochastic Matrix
- A Lower Bound for the Monomer-Dimer Problem
- Asymptotic Enumeration of Spanning Trees
