Fast mixing for independent sets, colorings and other models on trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial criteria for uniqueness of Gibbs measures
Random Structures & Algorithms
Optimal phylogenetic reconstruction
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Slow emergence of cooperation for win-stay lose-shift on trees
Machine Learning
Simple deterministic approximation algorithms for counting matchings
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Distributed averaging via lifted Markov chains
IEEE Transactions on Information Theory
Dobrushin conditions for systematic scan with block dynamics
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.06 |
We study discrete time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with n vertices and of bounded degree. We show that the relaxation time (defined as the reciprocal of the spectral gap 1 - \lambda _2 for the dynamics on trees and on certain hyperbolic graphs is polynomial in n. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that if the relaxation time T2 satisfies T2 = O(n), then the correlation coefficient, and the mutual information, between any local function (which dependsonly on the configuration in a fixed window) and the boundary conditions, decays exponentially in the distance between the window and the boundary. For the Ising model on a regular tree, this condition is sharp.