Reconstruction for the potts model

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 581-590

  Sly, Allan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Theory

Indexed keywords

ASYMPTOTICS; COMPUTATIONAL BIOLOGY; COMPUTATIONAL PROBLEM; EXACT RECONSTRUCTION; LOCAL SEARCH ALGORITHM; NON-BINARY; PHYLOGENETIC RECONSTRUCTION; PHYLOGENETICS; POTTS MODELS; Q-STATE POTTS MODEL; RANDOM CONSTRAINT SATISFACTION PROBLEMS; RANDOM GRAPHS; RANDOM K-SAT; RECONSTRUCTION PROBLEMS; REGULAR TREE; SHORT SEQUENCES; SMALL CLUSTERS; STATISTICAL PHYSICS; SYMMETRIC MODEL; THEORY;

BINARY SEQUENCES; BINARY TREES; BIOINFORMATICS; BIOLOGY; COMPUTER SCIENCE; CONCRETE BEAMS AND GIRDERS; LEARNING ALGORITHMS; PHASE TRANSITIONS;

REPAIR;

EID: 70350682009     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536493     Document Type: Conference Paper

References (23)

1. Dimitris Achlioptas and Amin Coja-Oghlan. Algorithmic barriers from phase transition. http://front.math.ucdavis.edu/0803.2122, 2008.
2. Noam Berger, Claire Kenyon, Elchanan Mossel, and Yuval Peres. Glauber dynamics on trees and hyperbolic graphs. Probab. Theory Related Fields, 131:311-340, 2005.
3. P. M. Bleher, J. Ruiz, and Zagrebnov V. A. On the purity of limiting gibbs state for the ising model on the bethe lattice. J. Stat. Phys, 79:473-Ü482, 1995.
4. Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, and Sébastien Roch. The kesten-stigum reconstruction bound is tight for roughly symmetric binary channels. In FOCS, pages 518-530. IEEE Computer Society, 2006.
5. J. T. Chayes, L. Chayes, James P. Sethna, and D. J. Thouless. A mean field spin glass with short-range interactions. Comm. Math. Phys., 106(1):41-89, 1986.
6. Constantinos Daskalakis, Elchanan Mossel, and Sébastien Roch. Optimal phylogenetic reconstruction. In STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 159-168,New York, 2006. ACM.
7. Martin Dyer, Alan Frieze, Thomas P. Hayes, and Eric Vigoda. Randomly coloring constant degree graphs. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 582-589, Washington, DC, USA, 2004. IEEE Computer Society.
8. William Evans, Claire Kenyon, Yuval Peres, and Leonard J. Schulman. Broadcasting on trees and the Ising model. Ann. Appl. Probab., 10(2):410-433, 2000.
9. M. Formentin and C Kuelske. On the purity of the free boundary condition potts measure on random trees. http://arxiv.org/abs/0810.0677, 2008.
10. A. Gerschenfeld and A. Montanari. Reconstruction for models on random graphs. In 48nd Annual Symposium on Foundations of Computer Science, Providence, RI, 2007.
11. H. Kesten and B. P. Stigum. Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann. Math. Statist., 37, 1966.
12. Florent Krza̧kalła, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborova. Gibbs states and the set of solutions of random constraint satisfaction problems. Proceedings of the National Academy of Sciences, 104:10318-10323, 2007.
13. Fabio Martinelli, Alistair Sinclair, and Dror Weitz. Fast mixing for independent sets, colorings, and other models on trees. Random Structures Algorithms, 31:134-172, 2007.
14. Marc Mézard and Andrea Montanari. Reconstruction on trees and spin glass transition. J. Stat. Phys., 124(6):1317-1350, 2006.
15. A. Montanari, R. Restrepo, and P. Tetali. Reconstruction and clustering in random constraint satisfaction problems. 2009.
16. Elchanan Mossel. Reconstruction on trees: beating the second eigenvalue. Ann. Appl. Probab., 11(1):285-300, 2001.
17. Elchanan Mossel. Phase transitions in phylogeny. Trans. Amer. Math. Soc., 356(6):2379-2404 (electronic), 2004.
18. Elchanan Mossel. Survey: information flow on trees. In Graphs, morphisms and statistical physics, volume 63 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 155-170. Amer. Math. Soc., Providence, RI, 2004.
19. Elchanan Mossel and Yuval Peres. Information flow on trees. Ann. Appl. Probab., 13:817-844, 2003.
20. Elchanan Mossel and Allan Sly. Gibbs rapidly samples colorings of g(n,d/n). http://arxiv.org/abs/0707.3241, 2007.
21. Guilhem Semerjian. On the freezing of variables inrandom constraint satisfaction problems. J.STAT.PHYS., 130:251, 2008.
22. Allan Sly. Reconstruction of random colourings. http://front.math. ucdavis.edu/0802.3487, 2008.
23. Lenka. Zdeborová and Florent. Krza̧kalła. Phase transitions in the coloring of random graphs. Phys. Rev. E, 76:031131, 2007.