Rapid mixing of the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs.
D. Eppstein and
D. Frishberg.
arXiv:2111.03898.
Proc 34th International Symposium on Algorithms and Computation (ISAAC 2023).
Leibniz International
Proceedings in Informatics (LIPIcs) 283, 2022, pp. 30:1–30:13, doi:10.4230/LIPIcs.ISAAC.2023.30.
A random walk on the independent sets or dominating sets of a graph mixes rapidly for graphs of bounded treewidth, and a random walk on maximal independent sets mixes rapidly for graphs of bounded carving width.
(Blog post: Random independent sets in bounded-treewidth graphs)