Improved bounds for sampling colorings

We consider the problem of sampling uniformly from the set of proper k-colorings of a graph with maximum degree /spl Delta/. Our main result is the design Markov chain that converges in O(nk log n) time to the desired distribution when k>11/6 /spl Delta/.

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

[2]  A. Frigessi,et al.  Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields , 1997 .

[3]  M. Dyer,et al.  Path Coupling, Dobrushin Uniqueness, and Approximate Counting , 1997 .

[4]  R. B. Potts.  Some generalized order-disorder transformations , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

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

[6]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

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

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

[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]  F. Papangelou.  GIBBS MEASURES AND PHASE TRANSITIONS (de Gruyter Studies in Mathematics 9) , 1990 .

[11]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

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

[13]  D. Stroock,et al.  The logarithmic sobolev inequality for discrete spin systems on a lattice , 1992 .

[14]  Eric Vigoda,et al.  Sampling from gibbs distributions , 1999 .

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