Gibbs rapidly samples colorings of G(n, d/n)

Probability Theory and Related Fields

Volumn 148, Issue 1, 2010, Pages 37-69

  Mossel, Elchanan ^a   Sly, Allan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Colorings; Erdo double acute s R nyi random graphs; Gibbs samplers; Glauber dynamics; Mixing time

Indexed keywords

EID: 77953812471     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-009-0222-x     Document Type: Article

References (25)

1. Aldous, D., Fill, J. A.: Reversible Markov chains and random walks on graphs. (Book in preparation.) Current version online at http://stat-www. berkeley. edu/users/aldous/book. html.
2. Berger N., Kenyon C., Mossel E., Peres Y.: Glauber dynamics on trees and hyperbolic graphs. Probab. Theory Relat. Fields 131(3), 311-340 (2005).
3. Bubley, R., Dyer, M.: Path coupling: a technique for proving rapid mixing in Markov chains. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 223-231 (1997).
4. Chen, M. F.: Trilogy of couplings and general formulas for lower bound of spectral gap. In: Probability towards 2000, number 128 in Lecture Notes in Statistics (1998).
5. Dyer M., Flaxman A. D., Frieze A. M., Vigoda E.: Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4), 450-465 (2006).
6. Dyer, M., Frieze, A., Hayes, T., Vigoda, E.: Randomly coloring constant degree graphs. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pp. 582-589 (2004).
7. Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. In: Proceedings of 40th IEEE Sypmosium on Foundations of Computer Science (FOCS), pp. 210-217 (1999).
8. Dyer M. E., Greenhill C. S.: On Markov chains for independent sets. J. Algorithms 35(1), 17-49 (2000).
9. Efthymiou, C., Spirakis, P. G.: Randomly colouring sparse graphs using a constant number of colours (2007, unpublished).
10. Frieze A. M., McDiarmid C.: Algorithmic theory of random graphs. Random Struct. Algorithms 10(1-2), 5-42 (1997).
11. Gershchenfeld, A., Montanari, A.: Reconstruction for models on random graphs. In: Foundations of Computer Science, Annual IEEE Symposium, pp. 194-204. IEEE Computer Society (2007).
12. Goldberg, L. A., Martin, R., Paterson, M.: Strong spatial mixing for lattice graphs with fewer colours. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pp. 562-571 (2004).
13. Hayes, T. P.: A simple condition implying rapid mixing of single-site dynamics on spin systems. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 39-46 (2006).
14. Jerrum M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Struct. Algorithms 7, 157-166 (1995).
15. Jerrum M., Sinclair A.: Approximating the permanent. SIAM J. Comput. 18(6), 1149-1178 (1989).
16. Jerrum M., Sinclair A., Vigoda E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. J. ACM 51(4), 671-697 (2004).
17. Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. In: 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), pp. 568-578. IEEE Computer Soc., Los Alamitos, CA (2001).
18. Martinelli, F.: Lectures on Glauber dynamics for discrete spin models. In: Lectures on Probability Theory and Statistics (Saint-Flour, 1997), vol. 1717 of Lecture Notes in Mathematics, pp. 93-191. Springer, Berlin (1999).
19. Martinelli, F., Sinclair, A., Weitz, D.: The ising model on trees: boundary conditions and mixing time. In: Proceedings of the Forty Fourth Annual Symposium on Foundations of Computer Science, pp. 628-639 (2003).
20. Mossel, E., Sly, A.: Rapid mixing of gibbs sampling on graphs that are sparse on average. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 238-247 (2008).
21. Mossel, E., Sly, A.: Rapid mixing of gibbs sampling on graphs that are sparse on average. Random Struct. Algorithms (2009, to appear).
22. Mossel E., Weitz D., Wormald N.: On the hardness of sampling independent sets beyond the tree threshold. Prob. Theory Relat. Fields 143, 401-439 (2009).
23. Shamir E., Upfal E.: Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces. J. Algorithms 5(4), 488-501 (1984).
24. Vigoda E.: A note on the glauber dynamics for sampling independent sets. Electron. J. Comb. 8(1), 1-8 (2001).
25. Weitz, D.: Counting indpendent sets up to the tree threshold. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 140-149. ACM (2006).