Randomly Coloring Constant Degree Graphs

We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the dynamics converges to a random coloring within O(n log n) steps assuming k k0() and either: (i) k/ > + where

• Type: Conference
• Year: 2004
• Where: FOCS
• Authors: Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
• Keywords: FOCS 2004, Glauber Dynamics, Random K-coloring, Simple Markov Chain, Theoretical Computer Science