A computational method for bounding the probability of reconstruction on trees

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 2, 2011, Pages 854-871

  Bhatnagar, Nayantara ^a   Maneva, Elitza ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF BARCELONA   (Spain)

Author keywords

Extremality; Galton Watson tree; Gibbs measure; Graph coloring; Markov random field; Potts model; Reconstruction; Replica symmetry breaking

Indexed keywords

EXTREMALITY; GALTON-WATSON TREE; GIBBS MEASURE; GRAPH COLORINGS; MARKOV RANDOM FIELDS; POTTS MODELS; REPLICA SYMMETRY BREAKINGS;

IMAGE SEGMENTATION; PLANT EXTRACTS; SURVEYS;

PROBABILITY DISTRIBUTIONS;

EID: 79960612280     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090751244     Document Type: Article

References (18)

1. N. BHATNAGAR, J. VERA, E. VIGODA, AND D. WEITZ, Reconstruction for colorings on trees, SIAM J. Discrete Math., XX (2011), pp. 809-826.
2. C. BORGS, J. 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.
3. 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.
4. M. FORMENTIN AND C. KÜLSKE, On the purity of the free boundary condition Potts measure on random trees, Stochastic Process. Appl., 119 (2009), pp. 2992-3005.
5. H. GEORGII, Gibbs Measures and Phase Transitions, de Gruyter Stud. Math. 9, de Gruyter, Berlin, 1988.
6. S. JANSON AND E. MOSSEL, Robust reconstruction on trees is determined by the second eigenvalue, Ann. Probab., 32 (2004), pp. 2630-2649. (Pubitemid 39258783)
7. H. KESTEN AND B. P. STIGUM, Additional limit theorems for indecomposable multidimensional Galton-Watson processes, Ann. Math. Statist., 37 (1966), pp. 1463-1481.
8. R. LYONS, Random walks and percolation on trees, Ann. Probab., 18 (1990), pp. 931-958.
9. 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.
10. M. MÉZARD AND A. MONTANARI, Reconstruction on trees and the spin glass transition, J. Stat. Phys., 124 (2006), pp. 1317-1350. (Pubitemid 44581231)
11. M. MÉZARD, G. PARISI, AND R. ZECCHINA, Analytic and algorithmic solution of random satisfiability problems, Science, 297 (2002), pp. 812-815; also available from http://www.sciencemag.org/cgi/content/full/sci;297/5582/812. (Pubitemid 34839626)
12. E. MOSSEL, Reconstruction on trees: Beating the second eigenvalue, Ann. Appl. Probab., 11 (2001), pp. 285-300.
13. E. MOSSEL AND Y. PERES, Information flow on trees, Ann. Appl. Probab., 13 (2003), pp. 817-844. (Pubitemid 39050991)
14. T. RICHARDSON AND R. URBANKE, The capacity of low-density parity check codes under message-passing decoding, IEEE Trans. Inform. Theory, 47 (2001), pp. 599-618. (Pubitemid 32318092)
15. T. RICHARDSON AND R. URBANKE, Modern Coding Theory, Cambridge University Press, London, 2008.
16. A. SLY, Reconstruction of random colourings, Commun. Math. Phys., 288 (2008), pp. 943-961.
17. A. SLY, Reconstruction of symmetric Potts models, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 2009, pp. 581-590.
18. L. ZDEBOROVA AND F. KRZAKALA, Phase transitions in the coloring of random graphs, Phys. Rev. E (3), 76 (2007), 031131.