A non-Markovian coupling for randomly sampling colorings

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 618-627

  Hayes, Thomas P ^a   Vigoda, Eric ^a  

^a THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; MAXIMUM PRINCIPLE; THEOREM PROVING;

GLAUBER DYNAMICS; NON-MARKOVIAN COUPLING; RANDOM SAMPLING COLORINGS;

COMPUTER SCIENCE;

EID: 0345412646     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. D. J. Aldous. Random walks on finite groups and rapidly mixing Markov chains. In Séminaire de Probabilities XVII, 243-297. Springer-Verlag, 1983. Lecture Notes in Mathematics 986.
2. R. Bubley and M. Dyer. Path coupling, Dobrushin uniqueness, and approximate counting. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 223-231, 1997.
3. G. R. Brightwell and P. Winkler. Random colorings of a Cayley tree. In Contemporary combinatorics, 247-276, János Bolyai Math. Soc., Budapest, 2002
4. W. Doeblin. Exposé de lat theorie des chaînes simples constantes de Markov à un nombre fini d'états. Rev. Math. Union Interbalkanique, 2:77-105, 1938.
5. D. Dubhashi and D. Ranjan. Balls and bins: a study in negative dependence. Random Structures and Algorithms, 13(2):99-124, 1998.
6. M. Dyer and A. Frieze. Randomly colouring graphs with lower bounds on girth and maximum degree. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 579-587, 2001.
7. M. Dyer and C. Greenhill On Markov chains for independent sets. J. Algorithms 35(1):17-49, 2000.
8. M. Dyer, A. Sinclair, E. Vigoda, and D. Weitz. Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. In Proceedings of RANDOM 2002, 149-163, Lecture Notes in Computer Science 2483.
9. T. P. Hayes. Randomly coloring graphs with girth at least five. In Proceedings of the 35th Annual ACM Symposium on Theory of Computer Science, 269-278, 2003.
10. M. R. Jerrum. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms, 7(2):157-165, 1995.
11. M. Luby and E. Vigoda Approximately counting up to four. In Proceedings of the 29th Annual ACM Symposium on Theory of Computer Science, 682-687, 1997.
12. M. Molloy. The Glauber dynamics on colorings of a graph with high girth and maximum degree. In Proceedings of the 34th Annual ACM Symposium on Theory of Computer Science, 91-98, 2002.
13. J. Salas and A. Sokal Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Statist. Phys. 86(3-4):551-579, 1997.
14. E. Vigoda. Improved bounds for sampling colorings. J. Math. Phys. 41(3):1555-1569, 2000.