A general lower bound for mixing of single-site dynamics on graphs

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least /spl Omega/(n log n), where it is the number of vertices. Our bound applies to the so-called "Glauber dynamics" that has been used extensively in algorithms for the Ising model, independent sets, graph colorings and other structures in computer science and statistical physics, and demonstrates that many of these algorithms are optimal up to constant factors within their class. Previously no super-linear lower bound for this class of algorithms was known. Though widely conjectured, such a bound had been proved previously only in very restricted circumstances, such as for the empty graph and the path. We also show that the assumption of bounded degree is necessary by giving a family of dynamics on graphs of unbounded degree with mixing time O(n).

[1]  Martin E. Dyer,et al.  An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings , 2001, SIAM J. Comput..

[2]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[3]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[4]  Cristopher Moore,et al.  Sampling grid colourings with fewer colours , 2004 .

[5]  Prasad Tetali,et al.  Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs , 2006, Random Struct. Algorithms.

[6]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[7]  Eric Vigoda,et al.  Improved bounds for sampling colorings , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[8]  L. A. Goldberg,et al.  Systematic scan for sampling colorings , 2006, math/0603323.

[9]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[10]  J. Besag.  Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[11]  John P. Moussouris.  Gibbs and Markov random systems with constraints , 1974 .

[12]  Prasad Tetali,et al.  Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs , 2006 .

[13]  Alan M. Frieze,et al.  Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[15]  Cristopher Moore,et al.  Sampling Grid Colorings with Fewer Colors , 2004, LATIN.

[16]  Thomas P. Hayes,et al.  A general lower bound for mixing of single-site dynamics on graphs , 2005 .

[17]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[18]  Eric Vigoda,et al.  A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..

[19]  Martin E. Dyer,et al.  On Counting Independent Sets in Sparse Graphs , 2002, SIAM J. Comput..

[20]  Martin E. Dyer,et al.  Mixing in time and space for lattice spin systems: A combinatorial view , 2002, RANDOM.