Gibbs states and the set of solutions of random constraint satisfaction problems

Proceedings of the National Academy of Sciences of the United States of America

Volumn 104, Issue 25, 2007, Pages 10318-10323

  Krza̧kała, Florent ^a   Montanari, Andrea ^b,c   Ricci Tersenghi, Federico ^d   Semerjian, Guilhem ^c   Zdeborová, Lenka ^e  

^a PSL RESEARCH UNIVERSITY   (France)

^b STANFORD UNIVERSITY   (United States)

^c LABORATOIRE DE PHYSIQUE STATISTIQUE   (France)

^d UNIVERSITÀ DI ROMA LA SAPIENZA   (Italy)

^e UNIVERSITÉ PARIS SUD   (France)

Author keywords

Message passing algorithms; Phase transitions; Random graphs

Indexed keywords

ALGORITHM; ARTICLE; DECOMPOSITION; MASS; MONTE CARLO METHOD; PHASE TRANSITION; POLYMERIZATION; PRIORITY JOURNAL; PROBABILITY; TECHNIQUE;

ALGORITHMS; ENTROPY; MARKOV CHAINS; MODELS, THEORETICAL; MONTE CARLO METHOD; PHASE TRANSITION;

EID: 34547273891     PISSN: 00278424     EISSN: None     Source Type: Journal    
DOI: 10.1073/pnas.0703685104     Document Type: Article

References (33)

1. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York).
2. Kschischang FR, Frey BJ, Loeliger H-A (2001) IEEE Trans Inform Theory 47:498-519.
3. Franco J, Paull M (1983) Discrete Appl Math 5:77-87.
4. Selman B, Kautz HA Cohen B (1994) in Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI Press, Seattle WA), pp 337-343.
5. Achlioptas D, Sorkin GB (2000) in Proceedings of the 41st Annual Symposium on the Foundations of Computer Science (IEEE Press, Los Alamitos, CA), pp 590-600.
6. Mézard M, Parisi G, Zecchina R (2002) Science 297:812-815.
7. Bayati M, Shah D, Sharma M (2006) in Proceedings of the IEEE International Symposium on Information Theory (IEEE Press, Los Alamitos, CA), pp 557-561.
8. Gamarnik D, Bandyopadhyay A (2006) in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (ACM Press, New York), pp 890-899.
9. Montanari A Shah D (2007) in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (ACM Press, New York), pp 1255-1264.
10. Friedgut E (1999) J Am Math Soc 12:1017-1054.
11. Mertens S, Mézard M, Zecchina R (2006) Rand Struct Alg 28:340-373.
12. Achlioptas D, Naor A, Peres Y (2005) Nature 435:759-764.
13. Mulet R, Pagnani A, Weigt M, Zecchina R (2002) Phys Rev Lett 89:268701.
14. Krzakala F, Pagnani A, Weigt M (2004) Phys Rev E 70:046705.
15. Luczak T (1991) Combinatorica 11:45-54.
16. Mézard M, Montanari A (2006) J Stat Phys 124:1317-1350.
17. Georgii HO (1988) Gibbs Measures and Phase Transitions (De Gruyter, Berlin).
18. Jonasson J (2002) Stat Prob Lett 57:243-248.
19. Aurell E, Gordon U, Kirkpatrick S (2004) Advances in Neural Information Processing Systems (MIT Press, Cambridge, MA), pp 49-56.
20. Maneva EN, Mossel E, Wainwright MJ (2005) in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (ACM Press, New York, 1089-1098.
21. Biroli G, Monasson R, Weigt M (2000) Eur Phys J B 14:551-568.
22. Mézard M, Mora T, Zecchina R (2005) Phys Rev Lett 94:197205.
23. Achlioptas D, Ricci-Tersenghi F (2006) in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (ACM Press, New York), pp 130-139.
24. Braunstein A, Zecchina R (2004) J Stat Mech P06007.
25. Mézard M, Palassini M, Rivoire O (2005) Phys Rev Lett 95:200202.
26. Ruelle D (1987) Commun Math Phys 108:225-239.
27. Talagrand M (2000) C R Acad Sci Paris Ser I 331:939-942.
28. Kesten H, Stigum BP (1966) Ann Math Stat 37:1463-1481.
29. Kesten H, Stigum BP (1966) J Math Anal Appl 17:309-338.
30. Montanari A, Ricci-Tersenghi F (2004) Phys Rev B 70:134406.
31. Yedidia J, Freeman WT, Weiss Y (2005) IEEE Trans Inform Theory 51:2282-2312.
32. Mézard M, Parisi G (2001) Eur Phys J B 20:217-233.
33. Mossel E, Peres Y (2003) Ann Appl Probab 13:817-844.