Reconstruction for models on random graphs

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

Volumn , Issue , 2007, Pages 194-204

  Gerschenfeld, Antoine ^a   Montanari, Andrea ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; CONCRETE BEAMS AND GIRDERS; FERROMAGNETISM; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; ISING MODEL; MAGNETISM; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RANDOM VARIABLES; REPAIR; RESTORATION; SPIN GLASS; TREES (MATHEMATICS);

(I ,J) CONDITIONS; JOINT PROBABILITY; RANDOM GRAPHS; SIMPLE ALGORITHMS; SUFFICIENT CONDITIONS;

GRAPH THEORY;

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

References (24)

1. D. Aldous, J. M. Steele, 'The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence,' in Probability on discrete structures, H. Kesten (ed.), New York, 2004
2. F. Guerra and F. L. Toninelli, 'The high temperature region of the Viana-Bray diluted spin glass model,' J. Stat. Phys. 115 (2004), 531-555.
3. D. Achlioptas and A. Naor, 'The two possible values of the chromatic number of a random graph,' Proc. of ACM STOC 2004
4. A. Guionnet and B. Zegarlinski, 'Lectures on Logarithmic Sobolev Inequalities,' Séminaire de Probabilites de Strasbourg, 36 (2002) 1-134
5. M. Dyer, A. Sinclair, E. Vigoda and D. Weitz, 'Mixing in time and space for lattice spin systems: A combinatorial view,' Rand. Struc. and Alg. 24, 461-479 (2004)
6. N. Berger, C. Kenyon, E. Mossel and Y. Peres, 'Glauber dynamics on trees and hyperbolic graphs,' Prob. Theory Rel. Fields 131, 311 (2005)
7. F. Martinelli, A. Sinclair, and D. Weitz, 'The Ising model on trees: boundary conditions and mixing time,' Proc. of IEEE FOCS 2003
8. A. Montanari and G. Semerjian, 'Rigorous Inequalities Between Length and Time Scales in Glassy Systems,' J. Stat. Phys. 125 (2006), 23-54
9. M. Mézard, G. Parisi and R. Zecchina 'Analytic and Algorithmic Solution of Random Satisfiability Problems,' Science 297 (2002), 812-815.
10. M. Mézard, T. Mora and R. Zecchina, 'Clustering of Solutions in the Random Satisfiability Problem,' Phys. Rev. Lett. 94, 197205.
11. D. Achlioptas and F. Ricci-Tersenghi, 'On the solution-space geometry of random constraint satisfaction problems,' Proc. of ACM STOC 2006
12. M. Mézard and A. Montanari 'Reconstruction on Trees and Spin Glass Transition,' J. Stat. Phys. 124 (2006), 1317-1350.
13. F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian and L. Zdeborova, 'Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems,' Proc. Natl. Acad. Sci. 1004, 10318 (2007)
14. A. Dembo and A. Montanari, in preparation
15. C. Daskalakis, E. Mossel, and S. Roch, 'Optimal Phylogenetic Reconstruction,' Proc. of ACM STOC 2006.
16. S. Bhamidi, R. Rajagopal and S. Roch 'Network Delay Inference from Additive Metrics,' preprint, 2007
17. H.-O. Georgii. Gibbs Measures and Phase Transition, de Gruyter, Berlin, 1988.
18. P. M. Bleher, J. Ruiz, and V. A. Zagrebnov, 'On the purity of limiting Gibbs state for the Ising model on the Bethe lattice,' J. Stat. Phys., 79 (1995), 473-482.
19. E. Mossel and Y. Peres, 'Information Flow on Trees,' Ann. Appl. Probab. 13 (2003), 817-844.
20. W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman. 'Broadcasting on trees and the Ising model,' Ann. Appl. Probab., 10 (2000) 410-433.
21. C. Borgs, J. Chayes, E. Mossel and S. Roch, 'The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels,' Proc. of IEEE FOCS 2006
22. E. Mossel, D. Weitz, and N. Wormald, 'On the hardness of sampling independent sets beyond the tree threshold,' arXiv:math/0701471
23. B. Bóllobas, 'A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs,' Eur. J. Combin. 1(1980), 311.
24. D. Achlioptas, A. Naor, and Y. Peres, 'Rigorous location of phase transitions in hard optimization problems,' Nature 435 (2005), 759