Sampling Grid Colorings with Fewer Colors

We provide an optimally mixing Markov chain for 6-colorings of the square grid. Furthermore, this implies that the uniform distribution on the set of such colorings has strong spatial mixing. Four and five are now the only remaining values of k for which it is not known whether there exists a rapidly mixing Markov chain for k-colorings of the square grid.

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

[2]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[3]  C Moore,et al.  Vortex dynamics and entropic forces in antiferromagnets and antiferromagnetic Potts models. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  F. Martinelli.  Lectures on Glauber dynamics for discrete spin models , 1999 .

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

[6]  P. Tetali,et al.  Analyzing Glauber dynamics by comparison of Markov chains , 2000 .

[7]  Wang,et al.  Antiferromagnetic Potts models. , 1989, Physical review letters.

[8]  Wang,et al.  Three-state antiferromagnetic Potts models: A Monte Carlo study. , 1990, Physical review. B, Condensed matter.

[9]  Catherine S. Greenhill,et al.  Surveys in Combinatorics, 1999: Random Walks on Combinatorial Objects , 1999 .

[10]  F. Cesi.  Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields , 2001 .

[11]  Dana Randall,et al.  Markov Chain Algorithms for Planar Lattice Structures , 2001, SIAM J. Comput..

[12]  Cristopher Moore,et al.  Height Representation, Critical Exponents, and Ergodicity in the Four-State Triangular Potts Antiferromagnet , 1999, cond-mat/9902295.

[13]  Martin Dyer,et al.  A more rapidly mixing Markov chain for graph colorings , 1998 .

[14]  Martin E. Dyer,et al.  Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing , 1998, SODA '98.

[15]  Alan D. Sokal,et al.  Antiferromagnetic Potts Models on the Square Lattice: A High-Precision Monte Carlo Study , 1998 .

[16]  Alan D. Sokal.  A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models , 2000 .

[17]  P. Diaconis,et al.  COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .

[18]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[19]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

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

[21]  Eric Vigoda.  Improved bounds for sampling colorings , 2000 .

[22]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[23]  A. Sokal,et al.  Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem , 1996, cond-mat/9603068.