Geometrical organization of solutions to random linear Boolean equations

Journal of Statistical Mechanics: Theory and Experiment

Volumn , Issue 10, 2006, Pages

  Mora, Thierry ^a   Mézard, Marc ^a  

^a UNIVERSITÉ PARIS SUD   (France)

Author keywords

Cavity and replica method; Message passing algorithms; Typical case computational complexity

Indexed keywords

EID: 42749099393     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2006/10/P10007     Document Type: Article

References (28)

1. Mézard M, Parisi G and Virasoro M A 1987 Spin-glass Theory and Beyond (Lecture Notes in Physics vol 9) (Singapore: World Scientific)
2. Gallager R G 1962 Low-density parity check codes IRE Trans. Inf. Theory 8 21
3. MacKay D J C 2003 Information Theory, Inference, and Learning Algorithms (Cambridge: Cambridge University Press)
4. Papadimitriou C H 1994 Computational Complexity (Reading, MA: Addison-Wesley)
5. Friedgut E 1999 Sharp thresholds of graph properties, and the k-SAT problem J. Am. Math. Soc. 12 1017
6. Mézard M, Parisi G and Zecchina R 2002 Analytic and algorithmic solution of random satisfiability problems Science 297 812-5
7. Mézard M and Zecchina R 2002 Random k-satisfiability problem: from an analytic solution to an efficient algorithm Phys. Rev. E 66 056126
8. Mulet R, Pagnani A, Weigt M and Zecchina R 2002 Coloring random graphs Phys. Rev. Lett. 89 268701
9. Semerjian G and Monasson R 2004 A study of pure random walk on random satisfiability problems with 'physical' methods Proc. SAT 2003 Conf. (Lecture Notes in Computer Science vol 120) ed E Giunchiglia and A Tachella (Berlin: Springer) p 2919
10. Mézard M, Mora T and Zecchina R 2005 Clustering of solutions in the random satisfiability problem Phys. Rev. Lett. 94 197205
11. Mora T, Mézard M and Zecchina R 2005 Pairs of SAT assignments and clustering in random Boolean formulae Preprint cond-mat/0506053
12. klog2-O(k) J. Am. Math. Soc. 17 947-73
13. Monasson R 1998 Optimization problems and replica symmetry breaking in finite connectivity spin-glasses J. Phys. A: Math. Gen. 31 513
14. Mézard M and Parisi G 2001 The Bethe lattice spin glass revisited Eur. Phys. J. B 20 217
15. Ricci-Tersenghi F, Weigt M and Zecchina R 2001 Simplest random k-satisfiability problem Phys. Rev. E 63 026702
16. Cocco S, Dubois O, Mandler J and Monasson R 2003 Rigorous decimation-based construction of ground pure states for spin glass models on random lattices Phys. Rev. Lett. 90 047205
17. Dubois O and Mandler J 2002 The 3-XORSAT threshold Proc. 43rd Ann. IEEE Symp. on Foundations of Computer Science (FOCS' 02) p 769
18. Mézard M, Ricci-Tersenghi F and Zecchina R 2003 Alternative solutions to diluted p-spin models and XORSAT problems J. Stat. Phys. 111 505
19. Richardson T and Urbanke R 2006 Modern Coding Theory at press, available at lthcwww.epfl.ch/mct
20. Nishimori H 2001 Statistical Physics of Spin Glasses and Information Processing: An Introduction (Oxford: Oxford University Press)
21. Yedidia J S, Freeman W F and Weiss Y 2002 Constructing free energy approximations and generalized belief propagation algorithms Technical Report TR-2002-35, Mitsubishi Electrical Research Laboratories available at http://www.merl.com
22. Kschischang F R, Frey B and Loeliger H-A 2001 Factor graphs and the sum-product algorithm IEEE Trans. Inf. Theory 47 498-519
23. Montanari A and Semerjian G 2005 On the dynamics of the glass transition on Bethe lattices Preprint cond-mat/0509366
24. Di C, Montanari A and Urbanke R 2004 Weight distributions of LDPC code ensembles: combinatorics meets statistical physics Int. Symp. on Information Theory (Piscataway, NJ: IEEE)
25. Di C, Proietti D, Telatar I E, Urbanke R L and Richardson T J 2002 Finite length analysis of low-density parity-check codes on the binary erasure channel IEEE Trans. Inf. Theory 48 1570-9
26. Condamin S 2002 Study of the weight enumerator function for a Gallager code http://www.inference.phy.cam.ac.uk/condamin/report.ps
27. Vardy A 1997 The intractability of computing the minimum distance of a code IEEE Trans. Inf. Theory 43 1757-66
28. Mézard M, Palassini M and Rivoire O 2005 Landscape of solutions in constraint satisfaction problems Phys. Rev. Lett. 95 200202