Randomly coloring graphs of girth at least five

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 269-278

  Hayes, Thomas P ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Chernoff bounds; Concentration inequalities; Glauber dynamics; Graph coloring; Markov chain Monte Carlo posterior analysis

Indexed keywords

GRAPH THEORY; MARKOV PROCESSES; MONTE CARLO METHODS; PROBABILITY;

GLAUBER DYNAMICS;

COMPUTER SCIENCE;

EID: 0037770106     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780583.780584     Document Type: Conference Paper

References (14)

1. G. Brightwell and P. Winkler. Random colorings of a Cayley tree. In B. Bollobás, editor, Contemporary Combinatorics, volume 10 of Bolyai Society Mathematical Studies. Springer Verlag, 2002.
2. R. Bubley and M. Dyer. Path coupling: a technique for proving rapid mixing in Markov chains. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 223-231. IEEE, October 1997.
3. D. Dubhashi. Simple proofs of occupancy tail bounds. Random Structures and Algorithms, 11(2):119-123, 1997.
4. D. Dubhashi and D. Ranjan. Balls and bins: a study in negative dependence. Random Structures and Algorithms, 13(2):99-124, 1998.
5. 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, pages 579-587. IEEE, October 2001.
6. M. Dyer, C. Greenhill, and M. Molloy. Very rapid mixing of the Glauber dynamics for proper colourings on bounded-degree graphs. Random Structures and Algorithms, 20:98-114, 2002.
7. T. Hayes. Randomly coloring bipartite graphs. Manuscript, in progress, 2003.
8. T. Hayes and E. Vigoda. A non-Markovian coupling technique. Technical Report TR-2003-02, University of Chicago, February 2003.
9. M. Jerrum. A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Structures and Algorithms, 7:157-165, 1995.
10. M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43:169-188, 1986.
11. 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, pages 91-98, 2002.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
13. J. Salas and A. Sokal. Absence of phase transition for anti-ferromagnetic Potts models via the Dobrushin uniqueness theorem. Journal of Statistical Physics, 86:551-579, 1997.
14. E. Vigoda. Improved bounds for sampling colorings. J. Math. Phys., 41:155-169, 2000.