Local uniformity properties for glauber dynamics on graph colorings

We investigate some local properties which hold with high probability for randomly selected colorings of a fixed graph with no short cycles. In a number of related works, establishing these particular properties has been a crucial step towards proving rapid convergence for the single-site Glauber dynamics, a Markov chain for sampling colorings uniformly at random. For a large class of graphs, this approach yields the most efficient known algorithms for sampling random colorings. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 2013

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

[2]  Michael Molloy,et al.  Randomly Colouring Graphs with Girth Five and Large Maximum Degree , 2006, LATIN.

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

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

[5]  Randomly Coloring Constant Degree Graphs , 2004, FOCS.

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

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

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

[9]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

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

[11]  Changsong Deng,et al.  Statistics and Probability Letters , 2011 .

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

[13]  Devdatt P. Dubhashi,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

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

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

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

[17]  L. Gordon,et al.  Poisson Approximation and the Chen-Stein Method , 1990 .