Strong spatial mixing with fewer colors for lattice graphs

SIAM Journal on Computing

Volumn 35, Issue 2, 2006, Pages 486-517

  Goldberg, Leslie Ann ^a   Martin, Russell ^b   Paterson, Mike ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Antiferromagnetic Potts model; Proper graph coloring; Strong spatial mixing

Indexed keywords

ANTIFERROMAGNETIC MATERIALS; COLOR; COMPUTATION THEORY; COMPUTATIONAL METHODS; STATISTICAL METHODS;

ANTIFERROMAGNETIC POTTS MODEL; PROPER GRAPH COLORING; STRONG SPATIAL MIXING;

TREES (MATHEMATICS);

EID: 33645767468     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445470     Document Type: Article

References (31)

1. D. ACHLIOPTAS, M. MOLLOY, C. MOORE, AND F. VAN BUSSEL, Sampling grid colorings with fewer colors, in Proceedings of the 6th Annual Latin American Theoretical Informatics (LATIN 2004), Buenos Aires, Argentina, pp. 80-89.
2. D. ALDOUS, Random walks on finite groups and rapidly mixing Markov chains, Séminaire de Probabilités XVII 1081/1082, A. Dold and B. Eckmann, eds., Lecture Notes in Math., 986, Springer-Verlag, Berlin, 1983, pp. 243-297.
3. G. BRIGHTWELL AND P. WINKLER, Graph homomorphisms and phase transitions, J. Combin. Theory Ser. B, 77 (1999), pp. 221-262.
4. R. BUBLEY AND M. DYER, Path coupling: A technique for proving rapid mixing in Markov chains, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1997), Miami Beach, FL, pp. 223-231.
5. R. BUBLEY, M. DYER, C. GREENHILL, AND M. JERRUM, On approximately counting colorings of small degree graphs, SIAM J. Comput., 29 (1999), pp. 387-400.
6. F. CESI, Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields, Probab. Theory Related Fields, 120 (2001), pp. 569-584.
7. P. DIACONIS AND L. SALOFF-COSTE, Comparison theorems for reversible Markov chains, Ann. Appl. Probab., 3 (1993), pp. 696-730.
8. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab., 1 (1991), pp. 36-61.
9. M. DYER AND A. FRIEZE, Randomly coloring graphs with lower bounds on girth and maximum degree, Random Structures Algorithms, 23 (2003), pp. 167-179.
10. M. DYER, A. FRIEZE, T. P. HAYES, AND E. VIGODA, Randomly coloring constant degree graphs, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Rome, pp. 582-589.
11. M. DYER, L.A. GOLDBERG, M. JERRUM, AND R. MARTIN, Markov chain comparison, available online at http://arxiv.org/abs/math.PR/0410331.
12. M. DYER AND C. GREENHILL, Random walks on combinatorial objects, in Surveys in Combinatorics, 1999, London Math. Soc. Lecture Note Ser. 267, J. D. Lamb and D. A. Preece, eds., Cambridge University Press, Cambridge, UK, 1999, pp. 101-136.
13. M. DYER, A. SINCLAIR, E. VIGODA, AND D. WEITZ, Mixing in time and space for lattice spin systems: A combinatorial view, Random Structures Algorithms, 24 (2004), pp. 461-479.
14. A. FRIEZE AND J. VERA, On randomly coloring locally sparse graphs, preprint 2004.
15. 2, Random Structures Algorithms, 24 (2004), pp. 279-302.
16. T. HAYES, Randomly coloring graphs of girth at least five, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), San Diego, CA, pp. 269-278.
17. T. HAYES AND E. VIGODA, A nonMarkovian coupling for randomly sampling colorings, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, pp. 618-627.
18. T. HAYES AND E. VIGODA, Coupling with the stationary distribution and improved sampling for colorings and independent sets, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), Vancouver, Canada, pp. 971-979.
19. M. JERRUM, A very simple algorithm for estimating the number of k-colorings of a low-degree graph, Random Structures Algorithms, 7 (1995), pp. 157-165.
20. C. KENYON, E. MOSSEL, AND Y. PERES, Glauber dynamics on trees and hyperbolic graphs, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), Las Vegas, NV, pp. 568-578.
21. M. LUBY, D. RANDALL, AND A. J. SINCLAIR, Markov chain algorithms for planar lattice structures, SIAM J. Comput., 31 (2001), pp. 167-192.
22. F. MARTINELLI, Lectures on Glauber dynamics for discrete spin models, Lectures on Probability Theory and Statistics, Saint-Flour, 1997. Lecture Notes in Math. 1717, Springer, Berlin (1999), pp. 93-191.
23. F. MARTINELLI, A. SINCLAIR, AND D. WEITZ, The Ising model on trees: Boundary conditions and mixing time, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, pp. 628-639.
24. F. MARTINELLI, A. SINCLAIR, AND D. WEITZ, Fast mixing for independent sets, colorings and other models on trees, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), New Orleans, pp. 456-465.
25. M. MOLLOY, The Glauber dynamics on colorings of a graph with high girth and maximum degree, SIAM J. Comput., 33 (2004), pp. 721-737.
26. D. RANDALL AND P. TETALI, Analyzing Glauber dynamics by comparison of Markov chains, J. Math. Phys., 41 (2000), pp. 1598-1615.
27. J. SALAS AND A. D. SOKAL, Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem, J. Statist. Phys., 86 (1997), pp. 551-579.
28. A. SINCLAIR, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin. Probab. Comput., 1 (1992), pp. 351-370.
29. E. VIGODA, Improved bounds for sampling colorings, J. Math. Phys., 41 (2000), pp. 1555-1569.
30. D. WEITZ, Combinatorial criteria for uniqueness of Gibbs measures, Random Structures Algorithms, to appear.
31. D. WEITZ, Mixing in Time and Space for Discrete Spin Systems, Ph.D. thesis, University of California, Berkeley, CA, 2004.