Abstract
We provide an optimally mixing Markov chain for 6-colorings of the square grid. Furthermore, this implies that the uniform distribution on the set of such colorings has strong spatial mixing. Four and five are now the only remaining values of k for which it is not known whether there exists a rapidly mixing Markov chain for k-colorings of the square grid. © Springer-Verlag 2004.
Cite
CITATION STYLE
Achlioptas, D., Molloy, M., Moore, C., & Van Bussel, F. (2004). Sampling grid colorings with fewer colors. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 80–89. https://doi.org/10.1007/978-3-540-24698-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
