Atoms of the matching measure
From MaRDI portal
Publication:2082687
DOI10.1214/22-EJP809zbMath1498.05138arXiv2005.12107OpenAlexW4290995314MaRDI QIDQ2082687
Publication date: 4 October 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.12107
Graph polynomials (05C31) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Matchings on infinite graphs
- Matchings in vertex-transitive bipartite graphs
- The rank of diluted random graphs
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- On quantum percolation in finite regular graphs
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- The Edmonds-Gallai decomposition for matchings in locally finite graphs
- The expected eigenvalue distribution of a large regular graph
- Mean quantum percolation
- Algebraic matching theory
- Analysis of the limiting spectral distribution of large dimensional random matrices
- Emergence of extended states at zero in the spectrum of sparse random graphs
- Every totally real algebraic integer is a tree eigenvalue
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Invariant random perfect matchings in Cayley graphs
- Processes on unimodular random networks
- Theory of monomer-dimer systems
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Matchings in Benjamini–Schramm convergent graph sequences
- Paths, Trees, and Flowers
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum
This page was built for publication: Atoms of the matching measure
