Weighted enumeration of spanning subgraphs in locally tree-like graphs
From MaRDI portal
Publication:2856580
Recommendations
- Weighted enumeration of spanning subgraphs with degree constraints
- Asymptotic Enumeration of Spanning Trees
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Tree and forest weights and their application to nonuniform random graphs
Cites work
- scientific article; zbMATH DE number 5485444 (Why is no real title available?)
- scientific article; zbMATH DE number 1952026 (Why is no real title available?)
- A survey of max-type recursive distributional equations
- Asymptotic Enumeration of Spanning Trees
- Counting unbranched subgraphs
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Gibbs measures and phase transitions on sparse random graphs
- Information, Physics, and Computation
- Ising models on locally tree-like graphs
- Karp-Sipser on random graphs with a fixed degree sequence
- Large deviations techniques and applications.
- Linear phase transition in random linear constraint satisfaction problems
- Matchings on infinite graphs
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Negative correlation and log-concavity
- Negatively correlated random variables and Mason's conjecture for independent sets in matroids
- On limits of finite graphs
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- The \(\zeta(2)\) limit in the random assignment problem
- The capacity of low-density parity-check codes under message-passing decoding
- The cavity method at zero temperature
- The complexity of computing the permanent
- The rank of diluted random graphs
- The weak limit of Ising models on locally tree-like graphs
- Theory of monomer-dimer systems
- Towards a theory of negative dependence.
- Weighted enumeration of spanning subgraphs with degree constraints
Cited in
(6)- Mean-field monomer-dimer models. A review
- Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
- A transition of limiting distributions of large matchings in random graphs
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- The densest subgraph problem in sparse random graphs
- Invariant probability measures and dynamics of exponential linear type maps
This page was built for publication: Weighted enumeration of spanning subgraphs in locally tree-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856580)
