Matchings on infinite graphs
From MaRDI portal
Publication:377529
DOI10.1007/s00440-012-0453-0zbMath1278.60018arXiv1102.0712OpenAlexW2060019200MaRDI QIDQ377529
Marc Lelarge, Justin Salez, Charles Bordenave
Publication date: 6 November 2013
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.0712
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Aggregation models on hypergraphs ⋮ Finite-size corrections for the attractive mean-field monomer-dimer model ⋮ Matchings on trees and the adjacency matrix: A determinantal viewpoint ⋮ Controllability, matching ratio and graph convergence ⋮ Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results ⋮ Towards an optimal contention resolution scheme for matchings ⋮ Sparse expanders have negative curvature ⋮ Random-link matching problems on random regular graphs ⋮ Tilings in graphons ⋮ Mean-Field Monomer-Dimer Models. A Review ⋮ The rank of diluted random graphs ⋮ A mean-field monomer-dimer model with attractive interaction: Exact solution and rigorous results ⋮ A mean-field monomer-dimer model with randomness: exact solution and rigorous results ⋮ Atoms of the matching measure ⋮ Weighted enumeration of spanning subgraphs in locally tree-like graphs ⋮ The rank of sparse random matrices ⋮ Minimal contagious sets in random regular graphs ⋮ Inverse problem for the mean-field monomer-dimer model with attractive interaction ⋮ The planted k-factor problem ⋮ The densest subgraph problem in sparse random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rank of diluted random graphs
- A survey of max-type recursive distributional equations
- On limits of finite graphs
- Homogeneous multivariate polynomials with the half-plane property
- Recurrence of distributional limits of finite planar graphs
- Processes on unimodular random networks
- Theory of monomer-dimer systems
- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
- Resolvent of large random graphs
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
- Borel oracles. An analytical approach to constant-time algorithms
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Matchings and walks in graphs
- Left and right convergence of graphs with bounded degree
- The number of matchings in random graphs
- Asymptotic Enumeration of Spanning Trees
- A new approach to the orientation of random hypergraphs
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
