Motivated by the 'subgraphs world' view of the ferromagnetic Ising model, we develop a general approach to studying mixing times of Glauber dynamics based on subset expansion expressions for a class of graph polynomials. With a canonical paths argument, we demonstrate that the chains defined within this framework mix rapidly upon graphs of bounded tree-width. This extends known results on rapid mixing for the Tutte polynomial, the adjacency-rank (R 2-)polynomial and the interlace polynomial. © 2011 Springer-Verlag.
CITATION STYLE
Bordewich, M., & Kang, R. J. (2011). Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6755 LNCS, pp. 533–544). https://doi.org/10.1007/978-3-642-22006-7_45
Mendeley helps you to discover research relevant for your work.