Reconstruction for colorings on trees

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 2, 2011, Pages 809-826

  Bhatnagar, Nayantara ^a   Juan, Vera ^b   Vigoda, Eric ^c   Weitz, Dror ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Georgia Institute of Technology   (United States)

^d NONE

Author keywords

Extremality of Gibbs measure; Random colorings; Reconstruction

Indexed keywords

BRANCHING FACTORS; EXTREMAL; GIBBS MEASURE; HIGH PROBABILITY; LINEAR ENTROPY; LOCAL ALGORITHM; MARKOV CHAIN; MIXING TIME; RANDOM COLORING; RANDOM GRAPHS; STRONG FORM;

COLORING; MARKOV PROCESSES; PLANT EXTRACTS; POTASSIUM;

TREES (MATHEMATICS);

EID: 79960593955     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090755783     Document Type: Article

References (35)

1. D. ACHLIOPTAS AND M. MOLLOY, Analysis of a list-coloring algorithm on a random graph, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1997, pp. 204-212.
2. D. ALDOUS, Random walks on finite groups and rapidly mixing Markov chains, in Séminaire de Probabilites XVII, Lecture Notes in Math. 986, Springer-Verlag, Berlin, 1983, pp. 243-297.
3. N. BHATNAGAR, J. VERA, AND E. VIGODA, Reconstruction for Colorings on Trees, preprint, 2007; also available online from http://arxiv.org/abs/0711. 3664v1.
4. N. BERGER, C. KENYON, E. MOSSEL, AND Y. PERES, Glauber dynamics on trees and hyperbolic graphs, Probab. Theory Related Fields, 131 (2005), pp. 311-340. (Pubitemid 40630123)
5. C. BORGS, J. T. CHAYES, E. MOSSEL, AND S. ROCH, The Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 518-530.
6. P. M. BLEHER, J. RUIZ, AND V. A. ZAGREBNOV, On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice, J. Stat. Phys., 79 (1995), pp. 473-482.
7. G. BRIGHTWELL AND P. WINKLER, Random colorings of a Cayley tree, in Contemporary Combinatorics, Bolyai Soc. Math. Stud. 10, B. Bollobas, ed., János Bolyai Math. Soc., Budapest, 2002, pp. 247-276.
8. G. BRIGHTWELL AND P. WINKLER, A second threshold for the hard-core model on a Bethe lattice, Random Structures Algorithms, 24 (2004), pp. 303-314. (Pubitemid 40030697)
9. C. DASKALAKIS, E. MOSSEL, AND S. ROCH, Optimal phylogenetic reconstruction, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006, pp. 159-168. (Pubitemid 44306549)
10. P. DIACONIS AND L. SALOFF-COSTE, Logarithmic Sobolev inequalities for finite Markov chains, Ann. Appl. Probab., 6 (1996), pp. 695-750.
11. D. DUBHASHI AND D. RANJAN, Balls and bins: A study in negative dependence, Random Structures Algorithms, 13 (1998), pp. 99-124.
12. W. EVANS, C. KENYON, Y. PERES, AND L. J. SCHULMAN, Broadcasting on trees and the Ising model, Ann. Appl. Probab., 10 (2000), pp. 410-433.
13. A. FRIEZE AND R. KANNAN, Log-Sobolev inequalities and sampling from log-concave distributions, Ann. Appl. Probab., 9 (1999), pp. 14-26.
14. A. FRIEZE AND E. VIGODA, A survey on the use of Markov chains to randomly sample colorings, in Combinatorics, Complexity and Chance, G. Grimmett and C. McDiarmid, eds., Oxford University Press, Oxford, 2007.
15. H. O. GEORGII, Gibbs Measures and Phase Transitions, de Gruyter Stud. Math. 9, de Gruyter, Berlin, 1988.
16. A. GERSCHENFELD AND A. MONTANARI, Reconstruction for models on random graphs, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 197-204.
17. L. GOLDBERG, M. JERRUM, AND M. KARPINSKI, The mixing time of Glauber dynamics for colouring regular trees, Random Structures Algorithms, to appear.
18. T. P. HAYES, J. VERA, AND E. VIGODA, Randomly coloring planar graphs with fewer colors than the maximum degree, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 2007, pp. 450-458. (Pubitemid 47630764)
19. J. JONASSON, Uniqueness of uniform random colorings of regular trees, Statist. Probab. Lett., 57 (2002), pp. 243-248.
20. F. KRZAKALA, A. MONTANARI, F. RICCI-TERSENGHI, G. SEMERJIAN, AND L. ZDEBOROVÁ, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 10318-10323. (Pubitemid 47185663)
21. B. LUCIER, M. MOLLOY, AND Y. PERES, The Glauber dynamics for colourings of bounded degree trees, in Approximation, Randomization and Combinatorial Optimization, Lecture Notes in Comput. Sci. 5687, Springer-Verlag, Berlin, 2009, 631645.
22. J. MARTIN, Reconstruction thresholds on regular trees, in Discrete Random Walks, DRW'03, Discrete Math. Theor. Comput. Sci. Proc., C. Banderier and C. Krattenthaler, eds., Paris, 2003, pp. 191-204.
23. F. MARTINELLI, A. SINCLAIR, AND D. WEITZ, Glauber dynamics on trees: Boundary conditions and mixing time, Commun. Math. Phys., 250 (2004), pp. 301-334. (Pubitemid 39374476)
24. F. MARTINELLI, A. SINCLAIR, AND D. WEITZ, Fast mixing for independent sets, colorings and other models on trees, Random Structures Algorithms, 31 (2007), pp. 134-172.
25. A. MONTANARI AND M. MÉZARD, Reconstruction on trees and spin glass transition, J. Stat. Phys., 124 (2006), pp. 1317-1350. (Pubitemid 44581231)
26. A. MONTANARI, R. RESTREPO, AND P. TETALI, Reconstruction and Clustering in Random Constraint Satisfaction Problems, preprint, 2009; also available online from http://arxiv.org/abs/0904.2751http://arxiv.org/abs/0904.2751.
27. R. MONTENEGRO AND P. TETALI, Mathematical aspects of mixing times in Markov chains, in Foundations and Trends in Theoretical Computer Science, Vol. 1, M. Sudan, ed., Now Publishers, Boston, Delft, 2006.
28. E. MOSSEL, Phase transitions in phylogeny, Trans. Amer. Math. Soc., 356 (2004), pp. 2379-2404. (Pubitemid 38671225)
29. E. MOSSEL, Survey: Information flow on trees, in Graphs, Morphisms and Statistical Physics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., J. Nešetřil and P. Winkler, eds., Amer. Math. Soc., Providence, RI, 2004, pp. 155-170.
30. E. MOSSEL AND Y. PERES, Information flow on trees, Ann. Appl. Probab., 13 (2003), pp. 817-844. (Pubitemid 39050991)
31. D. WEITZ, Mixing in Time and Space for Discrete Spin Systems, Ph.D. thesis, University of California, Berkeley, CA, 2004, also available from http://www.drorweitz.com/ac/thesis/thesis.pdf.
32. L. SALOFF-COSTE, Lectures on finite Markov chains, in Lectures on Probability Theory and Statistics, Lecture Notes in Math. 1665, Springer-Verlag, Berlin, 1997, pp. 301-412.
33. G. SEMERJIAN, On the freezing of variables in random constraint satisfaction problems, J. Stat. Phys., 130 (2008), pp. 251-294.
34. A. SLY, Reconstruction of Random Colourings, Commun. Math. Phys., 288 (2009), pp. 943-961.
35. L. ZDEBOROVÁ AND F. KRZAKALA, Phase transitions in the coloring of random graphs, Phys. Rev. E, 76 (2007), 031131.