Sampling grid colourings with fewer colours

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

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

[2]  Dana Randall,et al.  Analyzing Glauber Dynamics by Comparison of Markov Chains , 1998, LATIN.

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

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

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

[6]  Leslie Ann Goldberg,et al.  Random sampling of 3-colorings in Z 2 , 2004 .

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

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

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

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

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

[12]  Martin E. Dyer,et al.  Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs , 2002, Random Struct. Algorithms.

[13]  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.

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

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

[16]  Martin E. Dyer,et al.  An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract) , 2000, SODA '00.

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

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

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

[20]  Martin E. Dyer,et al.  Mixing in time and space for lattice spin systems: A combinatorial view , 2002, International Workshop Randomization and Approximation Techniques in Computer Science.

[21]  October I.  Physical Review Letters , 2022 .

[22]  Thomas P. Hayes.  Randomly coloring graphs of girth at least five , 2003, STOC '03.

[23]  Michael Molloy.  Very rapidly mixing Markov Chains for 2D-colorings and for independent sets in a graph with maximum degree 4 , 2001 .

[24]  A more rapidly mixing Markov chain for graph colorings , 1998, Random Struct. Algorithms.

[25]  Mark Jerrum,et al.  Mathematical Foundations of the Markov Chain Monte Carlo Method , 1998 .

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

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

[28]  Martin E. Dyer,et al.  Randomly colouring graphs with lower bounds on girth and maximum degree , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[29]  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.

[30]  Antiferromagnetic Potts models on the square lattice. , 1994, Physical review. B, Condensed matter.