Randomly coloring constant degree graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 582-589

  Dyer, Martin ^a   Frieze, Alan ^b   Hayes, Thomas P ^c   Vigoda, Eric ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS; POLYNOMIALS; RANDOM PROCESSES;

CONSTANT DEGREE GRAPHS; DYNAMIC COVERAGES; MARKOV CHAIN MONTE CARLO (MCMC); RANDOM COLORING;

GRAPH THEORY;

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

References (17)

1. J. van den Berg and J.E. Steif, Percolation and the hard-core lattice gas model, Stochastic Processes and their Applications 49(2):179-197, 1994.
2. G. R. Brightwell and P. Winkler, Random colorings of a Cayley tree. Contemporary combinatorics, 10:247-276, 2002.
3. R. Bubley and M.E. Dyer, Path coupling: a technique for proving rapid mixing in Markov chains, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 223-231, 1997.
4. W. Doeblin, Exposé de la théorie des chaînes simples constantes de Markov à un nombre fini d'états, Revue Mathématique de l'Union Inter-balkanique, 2:77-105, 1938.
5. M. Dyer, A. Frieze. Randomly colouring graphs with lower bounds on girth and maximum degree. Random Structures and Algorithms, 23 (2):167-179, 2003.
6. M.E. Dyer, A.M. Frieze and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, Journal of the Association for Computing Machinery 38(1):1-17, 1991.
7. T. P. Hayes. Randomly coloring graphs of girth at least five. Preprint. A preliminary version appears in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 269-278, 2003.
8. T. P. Hayes and E. Vigoda. A Non-Markovian Coupling for Randomly Sampling Colorings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 618-627, 2003.
9. T. P. Hayes and E. Vigoda. Variable length path coupling. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 96-103, 2004.
10. M.R. Jerrum, A very simple algorithm for estimating the number of k-colourings of a low-degree graph, Random Structures and Algorithms 7(2):157-165, 1995.
11. M.R. Jerrum, A. Sinclair and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. To appear in Journal of the Association for Computing Machinery. A preliminary version appears in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 712-721, 2001.
12. M.R. Jerrum, L.G. Valiant and V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science 43(2-3): 169-188, 1986.
13. 5) volume algorithm for convex bodies, Random Structures and Algorithms 11(1):1-50, 1997.
14. 4) Volume Algorithm. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 650-659, 2003.
15. M. Molloy, The Glauber dynamics on colorings of a graph with high girth and maximum degree. To appear in SIAM Journal on Computing. A preliminary version appears in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 91-98, 2002.
16. J. Salas and A. Sokal, Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem, Journal of Statistical Physics 86(3-4):551-579, 1997.
17. E. Vigoda, Improved bounds for sampling colorings, Journal of Mathematical Physics 41(3): 1555-1569, 2000.