A survey on the use of Markov chains to randomly sample colorings

In recent years there has been considerable progress on the analysis of Markov chains for generating a random coloring of an input graph. These improvements have come in conjunction with refinements of the coupling technique, which is a classical tool in probability theory. We survey results on generating random colorings, and related technical improvements.

[1]  Thomas P. Hayes,et al.  Variable length path coupling , 2004, SODA '04.

[2]  Leslie Ann Goldberg,et al.  Strong spatial mixing for lattice graphs with fewer colours , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

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

[5]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[6]  Alan M. Frieze,et al.  On randomly colouring locally sparse graphs , 2006, Discret. Math. Theor. Comput. Sci..

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

[8]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[9]  I. Pinelis.  On inequalities for sums of bounded random variables , 2006, math/0603030.

[10]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[11]  Thomas P. Hayes,et al.  A general lower bound for mixing of single-site dynamics on graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

[13]  Martin E. Dyer,et al.  Randomly coloring constant degree graphs , 2004, Random Struct. Algorithms.

[14]  Michael Molloy,et al.  The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree , 2004, SIAM J. Comput..

[15]  Miklós Simonovits,et al.  Random walks and an O*(n5) volume algorithm for convex bodies , 1997, Random Struct. Algorithms.

[16]  Thomas P. Hayes,et al.  A non-Markovian coupling for randomly sampling colorings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

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

[19]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

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

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

[22]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

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

[24]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[25]  Martin E. Dyer,et al.  Randomly coloring graphs with lower bounds on girth and maximum degree , 2003, Random Struct. Algorithms.

[26]  Marek Karpinski,et al.  Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs , 2005, Electron. Colloquium Comput. Complex..

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

[28]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[29]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[30]  D. J. A. Welsh,et al.  A randomised 3-colouring algorithm , 1989, Discret. Math..

[31]  Fabio Martinelli,et al.  Fast mixing for independent sets, colorings, and other models on trees , 2004, SODA '04.

[32]  Eric Vigoda,et al.  Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings , 2005, J. Discrete Algorithms.

[33]  J. Jonasson.  Uniqueness of uniform random colorings of regular trees , 2002 .

[34]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[35]  Thomas P. Hayes,et al.  Coupling with the stationary distribution and improved sampling for colorings and independent sets , 2005, SODA '05.