Mixing of Markov chains for independent sets on chordal graphs with bounded separators
From MaRDI portal
Publication:2019517
DOI10.1007/978-3-030-58150-3_54OpenAlexW3081583587MaRDI QIDQ2019517FDOQ2019517
Authors: Ivona Bezáková, Wenbo Sun 
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_54
Cites Work
- Probabilistic graphical models.
- On the hardness of sampling independent sets beyond the tree threshold
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Improved inapproximability results for counting independent sets in the hard-core model
- Counting independent sets up to the tree threshold
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- Approximating the Permanent
- On Counting Independent Sets in Sparse Graphs
- Fast convergence of the Glauber dynamics for sampling independent sets
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Counting in two-spin models on \(d\)-regular graphs
- A characterisation of rigid circuit graphs
- On Markov Chains for Independent Sets
- A graph polynomial for independent sets of bipartite graphs
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Graph-Theoretic Concepts in Computer Science
- A note on the Glauber dynamics for sampling independent sets
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
- Counting independent sets in graphs with bounded bipartite pathwidth
This page was built for publication: Mixing of Markov chains for independent sets on chordal graphs with bounded separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019517)
