The Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels

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

Volumn , Issue , 2006, Pages 518-527

  Borgs, Christian ^a   Chayes, Jennifer ^a   Mossel, Elchanan ^b   Roch, Sebastien ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMMUNICATION CHANNELS (INFORMATION THEORY);

BINARY CHANNELS; GLAUBER DYNAMICS; KESTEN-STIGUM RECONSTRUCTION; PHYLOGENETIC RECONSTRUCTION;

PROBLEM SOLVING;

EID: 38749120964     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.76     Document Type: Conference Paper

References (28)

1. N. Berger, C. Kenyon, E. Mossel, and Y. Peres. Glauber dynamics on trees and hyperbolic graphs. Probab. Theory Related Fields, 131(3):311-340, 2005.
2. Extended abstract by Kenyon, Mossel and Peres appeared in proceedings of 42nd IEEE Symposium on Foundations of Computer Science (FOCS) 2001, 568-578.
3. 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. Statist. Phys., 79(1-2):473-482, 1995.
4. J. T. Chayes, L. Chayes, J. P. Sethna, and D. J. Thouless. A mean field spin glass with short-range interactions. Comm. Math. Phys., 106(1):41-89, 1986.
5. C. Daskalakis, E. Mossel, and S. Roch. Optimal Phylogenetic Reconstruction. Availible on the Arxiv at math.PR/0509575, Extended abstract to appear at Proceedings of STOC 2006, 2006.
6. W. S. Evans, C. Kenyon, Y. Y. Peres, and L. J. Schulman. Broadcasting on trees and the Ising model. Ann. Appl. Probab., 10(2):410-133, 2000.
7. W. S. Evans and L. J. Schulman. Signal propagation and noisy circuits. IEEE Trans. Inform. Theory, 45(7):2367-2373, 1999.
8. J. Felsenstein. Inferring Phytogenies. Sinauer, New York, New York, 2004.
9. H. Furstenberg. Intersections of Cantor sets and transversality of semigroups. In Problems in analysis (Sympos. Salomon Bochner, Princeton Univ., Princeton, N.J., 1969), pages 41-59. Princeton Univ. Press, Princeton, N.J., 1970.
10. H. O. Georgii. Gibbs measures and phase transitions, volume 9 of de Gruyter Studies in Mathematics. Walter de Gruyter & Co., Berlin, 1988.
11. Y. Higuchi. Remarks on the limiting Gibbs states on a (d + 1)-tree. Publ. Res. Inst. Math. Sci., 13(2):335-348, 1977.
12. D. Ioffe. On the extremality of the disordered state for the Ising model on the Bethe lattice. Lett. Math Phys., 37(2): 137-143, 1996.
13. S. Janson and E. Mossel. Robust reconstruction on trees is determined by the second eigenvalue. Ann. Probab., 32:2630-2649, 2004.
14. H. Kesten and B. P. Stigum. Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann. Math Statist., 37:1463-1481, 1966.
15. R. Lyons. The Ising model and percolation on trees and tree-like graphs. Comm. Math. Phys., 125(2):337-353, 1989.
16. R. Lyons. Random walks and percolation on trees. Ann. Probab., 18(3):931-958, 1990.
17. F. Martinelli, A. A. Sinclair, and D. Weitz. Glauber dynamics on trees: boundary conditions and mixing time. Comm. Math. Phys., 250(2):301-334, 2004.
18. F. Martinelli, A. Sinclair, and D. Weitz. Fast mixing for independent sets, colorings, and other models on trees. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 449-458, 2004.
19. M. Mezard and A. Montanari. Reconstruction on trees and the spin glass transition, 2006. Preprint.
20. M. Mezard, G. Parisi, and R. Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297, 812, 2002. (Scienceexpress published online 27-June-2002; 10.1126/science. 1073287).
21. M. Mezard and R. Zecchina. Random k-satisfiability: from an analytic solution to an effici ent algorithm. Phys. Rev. E, 66, 2002.
22. E. Mossel. Recursive reconstruction on periodic trees. Random Structures Algorithms, 13(1):81-97, 1998.
23. E. Mossel. Reconstruction on trees: beating the second eigenvalue. Ann. Appl. Probab., 11(1):285-300, 2001.
24. E. Mossel. Survey: Information flow on trees. In J. Nestril and P. Winkler, editors, Graphs, Morphisms and Statistical Physics. DIMACS series in discrete mathematics and theoretical computer science, pages 155-170. Amer. Math. Soc., 2004.
25. E. Mossel and Y Peres. Information flow on trees. Ann. Appl. Probab., 13(3):817-844, 2003.
26. R. Pemantle and Y. Peres. The critical Ising model on trees, concave recursions and nonlinear capacity. Available at: arXiv:math.PR/0503137.
27. F. Spitzer. Markov random fields on an infinite tree. Ann. Probability, 3(3):387-398, 1975.
28. J. von Neumann. Probabilistic logics and the synthesis of reliable organisms from unreliable components. In Automata studies, Annals of mathematics studies, no. 34, pages 43-98. Princeton University Press, Princeton, N. J., 1956.