 Such problems can, for sufficiently large number of colors, be answered using the Markov chain Monte Carlo method and showing that the mixing time grows only as formula_6 .This example and the shuffling example possess the rapid mixing property, that the mixing time grows at most polynomially fast in formula_7(number of states of the chain).Tools for proving rapid mixing include arguments based on conductance and the method of coupling.