The vertex separation number of a graph equals its path-width
Information Processing Letters
Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Discrete Mathematics
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
A Two-Variable Interlace Polynomial
Combinatorica
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
Computing in Science and Engineering
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Fast mixing for independent sets, colorings, and other models on trees
Random Structures & Algorithms
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Theory of Computing Systems
The mixing time of Glauber dynamics for coloring regular trees
Random Structures & Algorithms
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating the partition function of the ferromagnetic Potts model
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
Random Structures & Algorithms
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Algorithmica - Special Issue: European Symposium on Algorithms, Design and Analysis
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
| Hi-index | 0.01 |
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 (R2-)polynomial and the interlace polynomial.