Mixing of Markov chains for independent sets on chordal graphs with bounded separators

DOI10.1007/978-3-030-58150-3_54MaRDI QIDQ2019517zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 1885142 (Why is no real title available?)
• A characterisation of rigid circuit graphs
• A graph polynomial for independent sets of bipartite graphs
• A note on the Glauber dynamics for sampling independent sets
• Approximating the Permanent
• Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
• Counting in two-spin models on \(d\)-regular graphs
• Counting independent sets in graphs with bounded bipartite pathwidth
• Counting independent sets up to the tree threshold
• Fast convergence of the Glauber dynamics for sampling independent sets
• Graph-Theoretic Concepts in Computer Science
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
• On Counting Independent Sets in Sparse Graphs
• On Markov Chains for Independent Sets
• On the hardness of sampling independent sets beyond the tree threshold
• Probabilistic graphical models.
• Spectral independence in high-dimensional expanders and applications to the hardcore model
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
• The intersection graphs of subtrees in trees are exactly the chordal graphs

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)