Information, Physics, and Computation

Information, Physics, and Computation

Volumn 9780198570837, Issue , 2009, Pages 1-584

  Mézard, Marc ^a   Montanari, Andrea ^b  

^a UNIVERSITÉ PARIS SUD   (France)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Belief propagation; Cavity method; Constraint satisfaction; Density evolution; Error correcting codes; Message passing; Phase transition; Satisfiability; Spin glasses; Survey propagation

Indexed keywords

CODES (SYMBOLS); FORMAL LOGIC; GLASS; PHASE DIAGRAMS; PHASE TRANSITIONS; SPIN GLASS; STATISTICAL PHYSICS;

BELIEF PROPAGATION; CAVITY METHOD; CONSTRAINT SATISFACTION; DENSITY EVOLUTION; ERROR CORRECTING CODE; SATISFIABILITY; SURVEY PROPAGATION;

MESSAGE PASSING;

EID: 84855197746     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1093/acprof:oso/9780198570837.001.0001     Document Type: Book

References (349)

1. Aarts, E. H. L., Korst, J. H. M., and van Laarhoven, P. J. M. (2003). Simulated annealing. In Local Search in Combinatorial Optimization, pp. 91-120. Princeton University Press.
2. Abou-Chacra, R., Anderson, P. W., and Thouless, D. J. (1973). A self-consistent theory of localization. J. Phys. C, 6, 1734-1752.
3. Achlioptas, D. (2001). Lower bounds for random 3-SAT via differential equations. Theor.Comput. Sci, 265, 159-185.
4. Achlioptas, D. (2007). Personal communication.
5. Achlioptas, D. and Moore, C. (2004). The chromatic number of random regular graphs. In Proc. RANDOM'04, Lecture Notes in Computer Science, Vol. 3122, pp. 219-228. Springer, Berlin.
6. Achlioptas, D. and Moore, C. (2007). Random k-SAT: Two moments suffice to cross a sharp threshold. SIAM J. Comput., 36, 740-762.
7. Achlioptas, D. and Naor, A. (2005). The two possible values of the chromatic number of a random graph. Ann. Math., 162, 1333-1349.
8. Achlioptas, D. and Peres, Y. (2004). The threshold for random k-SAT is 2k log 2 -O(k). J. Am. Math. Soc., 17, 947-973.
9. Achlioptas, D. and Ricci-Tersenghi, F. (2006). On the solution-space geometry of random constraint satisfaction problems. In Proc. 38th ACM Symposium on Theory of Computing, STOC, Seattle, WA.
10. Achlioptas, D., Naor, A., and Peres, Y. (2005). Rigorous location of phase transitions in hard optimization problems. Nature, 435, 759-764.
11. Aizenman, M., Sims, R., and Starr, S. L. (2005). Mean-field spin glass models from the Cavity-ROSt perspective. In Mathematical Physics of Spin Glasses, Cortona. Eprint arXiv:math-ph/0607060.
12. Aji, S. M. and McEliece, R. J. (2000). The generalized distributive law. IEEE Trans. Inf. Theory, 46, 325-343.
13. Aji, A., Jin, H., Khandekar, A., MacKay, D., and McEliece, R. (2001). BSC thresholds for code ensembles based on 'Typical Pairs' decoding. In Codes, Systems, and Graphical Models, IMA Volumes in Mathematics and Its Applications, Vol.123, pp. 1-37. Springer, Berlin.
14. Alava, M., Ardelius, J., Aurell, E., Kaski, P., Krishnamurthy, S., Orponen, P., and Seitz, S. (2007). Circumspect descent prevails in solving random constraint satisfaction problems. Eprint arXiv:0711.4902.
15. Aldous, D. (1992). Asymptotics in the random assignment problem. Probab. Theory Relat. Fields, 93, 507-534.
16. Aldous, D. (2001). The ζ(2) limit in the random assignment problem. Random Struct. Algorithms, 18, 381-418.
17. Aldous, D. and Bandyopadhyay, A. (2005). A survey of max-type recursive distributional equations. Ann. Appl. Probab., 15, 1047-1110.
18. Aldous, D. and Fill, J. (2008). Reversible Markov chains and random walks on graphs. Book in preparation. Available online at .
19. Aldous, D. and Steele, J. M. (2003). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures (ed. H. Kesten), pp. 1-72. Springer, Berlin.
20. Altarelli, F., Monasson, R., and Zamponi, F. (2007). Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NPcomplete extensions. J. Phys. A, 40, 867-886. Proc. International Workshop on Statistical-Mechanical Informatics, Kyoto.
21. Amraoui, A., Montanari, A., Richardson, T. J., and Urbanke, R. (2004). Finite-length scaling for iteratively decoded LDPC ensembles. IEEE Trans. Inf. Theory, in press. Eprint .
22. Amraoui, A., Montanari, A., and Urbanke, R. (2007). How to find good finite-length codes: From art towards science. Eur. Trans. Telecommun., 18, 491-508.
23. Applegate, D., Bixby, R., Chvátal, V., and Cook, W. The traveling salesman problem. Available online at .
24. Ardelius, J. and Aurell, E. (2006). Behavior of heuristics on large and hard satisfiability problems. Phys. Rev. E, 74, 037702.
25. Baldassi, C., Braunstein, A., Brunel, N., and Zecchina, R. (2007). Efficient supervised learning in networks with binary synapses. Proc. Natl. Acad. Sci., 1049, 11079-11084.
26. Balian, R. (1992). From Microphysics to Macrophysics: Methods and Applications of Statistical Physics. Springer, New York.
27. Bandyopadhyay, A. and Gamarnik, D. (2006). Counting without sampling: New algorithms for enumeration problems using statistical physics. In Proc. 17th annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York.
28. Barg, A. (1998). Complexity issues in coding theory. In Handbook of Coding Theory (ed. V. S. Pless and W. C. Huffman), Chapter 7. Elsevier Science, Amsterdam.
29. Barg, A. and Forney, G. D. (2002). Random codes: minimum distances and error exponents. IEEE Trans. Inf. Theory, 48, 2568-2573.
30. Bauke, H. (2002). Statistische Mechanik des Zahlenaufteilungsproblems. Available at: .
31. Baxter, R. J. (1982). Exactly Solved Models in Statistical Mechanics. Academic Press, London.
32. Bayati, M., Shah, D., and Sharma, M. (2005). Maximum weight matching via maxproduct belief propagation. In Proc. IEEE International Symposium on Information Theory, Adelaide, pp. 1763-1767.
33. Bayati, M., Shah, D., and Sharma, M. (2006). A simpler max-product maximum weight matching algorithm and the auction algorithm. In Proc. IEEE International Symposium on Information Theory, Seattle, pp. 557-561.
34. Bender, E. A. and Canfield, E. R. (1978). The asymptotic number of labeled graphs with given degree sequence. J. Comb. Theory (A), 24, 296-307.
35. Berger, N., Kenyon, C., Mossel, E., and Peres, Y. (2005). Glauber dynamics on trees and hyperbolic graphs. Probab. Theory Relat. Fields, 131, 311-340.
36. Berlekamp, E., McEliecee, R. J., and van Tilborg, H. C. A. (1978). On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory, 29, 384-386.
37. Berrou, C. and Glavieux, A. (1996). Near optimum error correcting coding and decoding: Turbo codes. IEEE Trans. Commun., 44, 1261-1271.
38. Bertsekas, D. P. (1988). The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res., 14, 105-123.
39. Bethe, H. A. (1935). Statistical theory of superlattices. Proc. R. Soc. London A, 150, 552-558.
40. Binder, K. and Young, A. P. (1986). Spin glasses: Experimental facts, theoretical concepts, and open questions. Rev. Mod. Phys., 58, 801-976.
41. Biroli, G. and Mézard, M. (2002). Lattice glass models. Phys. Rev. Lett., 88, 025501.
42. Boettcher, S. (2003). Numerical results for ground states of mean-field spin glasses at low connectivities. Phys. Rev. B, 67, 060403.
43. Bollobás, B. (1980). A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combinatorics, 1, 296-307.
44. Bollobás, B. (2001). Random Graphs. Cambridge University Press, Cambridge.
45. Bollobas, B., Borgs, C., Chayes, J. T., Kim, J. H., and Wilson, D. B. (2001). The scaling window of the 2-SAT transition. Random Struct. Algorithms, 18, 201-256.
46. Borgs, C., Chayes, J., and Pittel, B. (2001). Phase transition and finite-size scaling for the integer partitioning problem. Random Struct. Algorithms, 19, 247.
47. Borgs, C., Chayes, J., Mertens, S., and Pittel, B. (2003). Phase diagram for the constrained integer partitioning problem. Random Struct. Algorithms, 24, 315-380.
48. Bouchaud, J.-P. and Biroli, G. (2004). On the Adam-Gibbs-Kirkpatrick-Thirumalai-Wolynes scenario for the viscosity increase in glasses. J. Chem. Phys, 121, 7347-7354.
49. Bouchaud, J.-P. and Mézard, M. (1997). Universality classes for extreme value statistics. J. Phys. A: Math. Gen., 30, 7997-8015.
50. Bouchaud, J.-P. and Potters, M. (2003). Theory of Financial Risk and Derivative Pricing. Cambridge University Press, Cambridge.
51. Bouchaud, J.-P., Cugliandolo, L., Kurchan, J., and Mézard, M. (1997). Out of equilibrium dynamics in spin glasses and other glassy systems. In Spin Glasses and Random Fields (ed. A. P. Young), pp.161-224. World Scientific, Singapore.
52. Bouchaud, J.-P., Mézard, M., and Dalibard, J. (eds.) (2007). Complex Systems: Lecture Notes of the Les Houches Summer School 2006. Elsevier, Amsterdam.
53. Boyd, S. P. and Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press, Cambridge.
54. Braunstein, A. and Zecchina, R. (2004). Survey propagation as local equilibrium equations. J. Stat. Mech., 06007.
55. Braunstein, A., Mulet, R., Pagnani, A., Weigt, M., and Zecchina, R. (2003). Polynomial iterative algorithms for coloring and analyzing random graphs. Phys. Rev. E, 68, 036702.
56. Braunstein, A., Mézard, M., and Zecchina, R. (2004). C code for the SP algorithm. Available online at .
57. Braunstein, A., Mézard, M., and Zecchina, R. (2005). Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms, 27, 201-226.
58. Burshtein, D. and Miller, G. (2004). Asymptotic enumeration methods for analyzing LDPC codes. IEEE Trans. Inf. Theory, 50, 1115-1131.
59. Burshtein, D., Krivelevich, M., Litsyn, S., and Miller, G. (2002). Upper bounds on the rate of LDPC codes. IEEE Trans. Inf. Theory, 48, 2437-2449.
60. Caracciolo, S., Parisi, G., Patarnello, S., and Sourlas, N. (1990). 3d Ising spin glass in a magnetic field and mean-field theory. Europhys. Lett., 11, 783.
61. Carlson, J. M., Chayes, J. T., Chayes, L., Sethna, J. P., and Thouless, D. J. (1990). Bethe lattice spin glass: The effects of a ferromagnetic bias and external fields. I. Bifurcation. J. Stat. Phys., 61, 987-1067.
62. Challet, D., Marsili, M., and Zhang, Y.-C. (2005). Minority Games. Oxford University Press, Oxford.
63. Chao, M.-T. and Franco, J. (1986). Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput, 15, 1106-1118.
64. Chao, M. T. and Franco, J. (1990). Probabilistic analysis of a generalization of the unitclause literal selection heuristics for the k-satisfiability problem. Inf. Sci, 51, 289-314.
65. Chavas, J., Furtlehner, C., Mézard, M., and Zecchina, R. (2005). Survey-propagation decimation through distributed local computations. J. Stat. Mech., 11016.
66. Chayes, J. T., Chayes, L., Sethna, J. P., and Thouless, D. J. (1986). A mean field spin glass with short-range interactions. Commun. Math. Phys., 106, 41-89.
67. Chung, S.-Y., Forney, G. D., Richardson, T. J., and Urbanke, R. (2001). On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun.Lett., 5, 58-60.
68. Chvátal, V. and Reed, B. (1992). Mick gets some (and the odds are on his side). In Proc. 33rd IEEE Symposium on Foundations of Computer Science, FOCS, Pittsburgh, pp. 620-627.
69. Ciliberti, S., Mézard, M., and Zecchina, R. (2005). Lossy data compression with random gates. Phys. Rev. Lett., 95, 038701.
70. Clifford, P. (1990). Markov random fields in statistics. In Disorder in Physical Systems: A Volume in Honour of John M. Hammersley (eds. G. Grimmett and D. Welsh), pp. 19-32. Oxford University Press, Oxford.
71. Cocco, S. and Monasson, R. (2001a). Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms. Eur. Phys. J. B, 22, 505-531.
72. Cocco, S. and Monasson, R. (2001b). Trajectories in phase diagrams, growth processes, and computational complexity: How search algorithms solve the 3-satisfiability problem. Phys. Rev. Lett., 86, 1654-1657.
73. Cocco, S., Dubois, O., Mandler, J., and Monasson, R. (2003). Rigorous decimationbased construction of ground pure states for spin-glass models on random lattices. Phys. Rev. Lett., 90, 047205.
74. Cocco, S., Monasson, R., Montanari, A., and Semerjian, G. (2006). Approximate analysis of search algorithms with physical methods. In Computational Complexity and Statistical Physics (eds. A. Percus, G. Istrate, and C. Moore), Santa Fe Studies in the Science of Complexity, pp. 1-37. Oxford University Press, Oxford.
75. Conway, J. H. and Sloane, N. J. A. (1998). Sphere Packings, Lattices and Groups. Springer, New York.
76. Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proc. 3rd ACM Symposium on the Theory of Computing, STOC, Shaker Heights, OH, pp. 151-158.
77. Coolen, A. C. C., Kuehn, R., and Sollich, P. (2005). Theory of Neural Information Processing Systems. Oxford University Press, Oxford.
78. Cooper, G. F. (1990). The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell./, 42, 393-405.
79. Coppersmith, D. and Sorkin, G. B. (1999). Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algorithms, 15, 133-144.
80. Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. Wiley, New York.
81. Creignou, N. and Daudé, H. (1999). Satisfiability threshold for random XOR-CNF formulas. Discrete Appl. Math., 96-97, 41-53.
82. Creignou, N., Daudé, H., and Dubois, O. (2003). Approximating the satisfiability threshold for random k-XOR-formulas. Combinatorics, Probab. Comput., 12, 113-126.
83. Crisanti, A. and Leuzzi, L. (2007). Amorphous-amorphous transition and the twostep replica symmetry breaking phase. Phys. Rev. B, 76, 184417.
84. Csiszár, I. and Körner, J. (1981). Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York.
85. Dagum, P. and Luby, M. (1993). Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artif. Intell., 60, 141-153.
86. Darling, R. W. R. and Norris, J. R. (2005). Structure of large random hypergraphs. Ann. Appl. Probab., 15, 125-152.
87. Daudé, H., Mézard, M., Mora, T., and Zecchina, R. (2008). Pairs of SAT assignments in random boolean formulae. Theor. Comput. Sci., 393, 260-279.
88. Davis, M. and Putnam, H. (1960). A computing procedure for quantification theory. J. Assoc. Comput. Mach., 7, 201-215.
89. Davis, M., Logemann, G., and Loveland, D. (1962). A machine program for theoremproving. Commun. ACM, 5, 394-397.
90. de Almeida, J. R. L. and Thouless, D. (1978). Stability of the Sherrington-Kirkpatrick solution of a spin glass model. J. Phys. A, 11, 983-990.
91. De Dominicis, C. and Mottishaw, P. (1987). Replica symmetry breaking in weak connectivity systems. J. Phys. A, 20, L1267-L1273.
92. de la Vega, W. F. (1992). On random 2-SAT. Unpublished manuscript.
93. de la Vega, W. F. (2001). Random 2-SAT: Results and problems. Theor. Comput. Sci., 265, 131-146.
94. Dembo, A. and Montanari, A. (2008a). Finite size scaling for the core of large random hypergraphs. Ann. Appl. Probab..
95. Dembo, A. and Montanari, A. (2008b). Graphical models, Bethe states and all that. In preparation.
96. Dembo, A. and Montanari, A. (2008c). Ising models on locally tree-like graphs. Eprint arxiv:0804.4726.
97. Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications. Springer, New York.
98. Derrida, B. (1980). Random-energy model: Limit of a family of disordered models. Phys. Rev. Lett., 45, 79.
99. Derrida, B. (1981). Random-energy model: An exactly solvable model of disordered systems. Phys. Rev. B, 24, 2613-2626.
100. Derrida, B. (1985). A generalization of the random energy model which includes correlations between energies. J. Physique Lett., 46, L401-L407.
101. Derrida, B. and Gardner, E. (1986). Solution of the generalised random energy model. J. Phys. C, 19, 2253-2274.
102. Derrida, B. and Toulouse, G. (1985). Sample to sample fluctuations in the random energy model. J. Physique Lett., 46, L223-L228.
103. Di, C., Proietti, D., Richardson, T. J., Telatar, E., and Urbanke, R. (2002). Finite length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory, 48, 1570-1579.
104. Di, C., Montanari, A., and Urbanke, R. (2004). Weight distribution of LDPC code ensembles: Combinatorics meets statistical physics. In Proc. IEEE International Symposium on Information Theory, Chicago, p. 102.
105. Di, C., Richardson, T. J., and Urbanke, R. (2006). Weight distribution of low-density paritycheck codes. IEEE Trans. Inf. Theory, 52, 4839-4855.
106. Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab., 3, 696-730.
107. Diaconis, P. and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab., 1, 36-61.
108. Dolecek, L., Zhang, Z., Anantharam, V., and Nikolić, B. (2007). Analysis of absorbing sets for array-based LDPC codes. In Proc. IEEE International Conference on Communications, ICC, Glasgow.
109. Dorogotsev, S. N., Goltsev, A. V., and Mendes, J. F. F. (2002). Ising models on networks wth arbitrary distribution of connections. Phys. Rev. E, 66, 016104.
110. Dubois, O. and Boufkhad, Y. (1997). A general upper bound for the satisfiability threshold of random r-sat formulae. J. Algorithms, 24, 395-420.
111. Dubois, O. and Mandler, J. (2002). The 3-XORSAT threshold. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, FOCS, pp. 769-778.
112. Duchet, P. (1995). Hypergraphs. In Handbook of Combinatorics (eds. R. Graham, M. Grotschel, and L. Lovasz), pp. 381-432. MIT Press, Cambridge, MA.
113. Durrett, R. (1995). Probability: Theory and Examples. Duxbury Press, New York.
114. Edwards, S. F. and Anderson, P. W. (1975). Theory of spin glasses. J. Phys. F, 5, 965-974.
115. Elias, P. (1955). Coding for two noisy channels. In Third London Symposium on Information Theory, pp. 61-76.
116. Ellis, R. S. (1985). Entropy, Large Deviations and Statistical Mechanics. Springer, New York.
117. Erdös, P. and Rényi, A. (1960). On the evolution of random graphs. Publ. Math. Sci. Hung. Acad. Sci, 5, 17-61.
118. Euler, L. (1736). Solutio problematis ad geometriam situs pertinentis. Comment. Acad. Sci. U. Petrop., 8, 128-140. Reprinted in Opera Omnia Ser. I-7, pp. 1-10, 1766.
119. Evans, W., Kenyon, C., Peres, Y., and Schulman, L. J. (2000). Broadcasting on trees and the Ising model. Ann. Appl. Probab., 10, 410-433.
120. Feller, W. (1968). An Introduction to Probability Theory and Its Applications. Wiley, New York.
121. Ferreira, F. F. and Fontanari, J. F. (1998). Probabilistic analysis of the number partitioning problem. J. Phys. A, 31, 3417-3428.
122. Fischer, K. H. and Hetz, J. A. (1993). Spin Glasses. Cambridge University Press, Cambridge.
123. Flajolet, P. and Sedgewick, R. (2008). Analytic Combinatorics. Cambridge University Press, Cambridge.
124. Forney, G. D. (2001). Codes on graphs: Normal realizations. IEEE Trans. Inf. Theory, 47, 520-548.
125. Forney, G. D. and Montanari, A. (2001). On exponential error bounds for random codes on the DMC. Available online at .
126. Franco, J. (2000). Some interesting research directions in satisfiability. Ann. Math. Artif. Intell., 28, 7-15.
127. Franz, S. and Leone, M. (2003). Replica bounds for optimization problems and diluted spin systems. J. Stat. Phys, 111, 535-564.
128. Franz, S. and Parisi, G. (1995). Recipes for metastable states in spin glasses. J. Physique I, 5, 1401.
129. Franz, S., Leone, M., Ricci-Tersenghi, F., and Zecchina, R. (2001a). Exact solutions for diluted spin glasses and optimization problems. Phys. Rev. Lett., 87, 127209.
130. Franz, S., Mézard, M., Ricci-Tersenghi, F., Weigt, M., and Zecchina, R. (2001b). A ferromagnet with a glass transition. Europhys. Lett., 55, 465.
131. Franz, S., Leone, M., Montanari, A., and Ricci-Tersenghi, F. (2002). Dynamic phase transition for decoding algorithms. Phys. Rev. E, 22, 046120.
132. Franz, S., Leone, M., and Toninelli, F. (2003). Replica bounds for diluted non-Poissonian spin systems. J. Phys. A, 36, 10967-10985.
133. Friedgut, E. (1999). Sharp thresholds of graph proprties, and the k-sat problem. J. Am. Math. Soc., 12, 1017-1054.
134. Friedman, N., Linial, M., Nachman, I., and Peér, D. (2000). Using bayesian networks to analyze expression data. J. Comput. Biol., 7, 601-620.
135. Galavotti, G. (1999). Statistical Mechanics: A Short Treatise. Springer, New York.
136. Gallager, R. G. (1962). Low-density parity-check codes. IEEE Trans. Inf. Theory, 8, 21-28.
137. Gallager, R. G. (1963). Low-Density Parity-Check Codes. MIT Press, Cambridge, MA. Available online at .
138. Gallager, R. G. (1965). A simple derivation of the coding theorem and some applications. IEEE Trans. Inf. Theory, IT-11, 3-18.
139. Gallager, R. G. (1968). Information Theory and Reliable Communication. Wiley, New York.
140. Gamarnik, D. (2004). Linear phase transition in random linear constraint satisfaction problems. Probab. Theory Relat. Fields, 129, 410-440.
141. Gardner, E. (1985). Spin glasses with p-spin interactions. Nucl. Phys. B, 257, 747-765.
142. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
143. Garey, M. R., Johnson, D. S., and Stockmeyer, L. (1976). Some simplified NPcomplete graph problems. Theor. Comput. Sci., 1, 237-267.
144. Gent, I. P. and Walsh, T. (1998). Analysis of heuristics for number partitioning. Comput. Intell., 14(3), 430-451.
145. Georgii, H.-O. (1988). Gibbs Measures and Phase Transitions. Walter de Gruyter, Berlin.
146. Gerschenfeld, A. and Montanari, A. (2007). Reconstruction for models on random graph. In Proc. 48th IEEE Symposium on Foundations of Computer Science, FOCS, Providence, RI, pp. 194-205.
147. Goerdt, A. (1996). A threshold for unsatisfiability. J. Comput. Syst. Sci., 53, 469-486.
148. Goldschmidt, Y. Y. (1991). Spin glass on the finite-connectivity lattice: The replica solution without replicas. Phys. Rev. B, 43, 8148-8152.
149. Goldschmidt, Y. Y. and De Dominicis, C. (1990). Replica symmetry breaking in the spinglass model on lattices with finite connectivity: Application to graph partitioning. Phys. Rev. B, 41, 2184-2197.
150. Goldschmidt, Y. Y. and Lai, P. Y. (1990). The finite connectivity spin glass: Investigation of replica symmetry breaking of the ground state. J. Phys. A, 23, L775-L782.
151. Gomes, C. P. and Selman, B. (2005). Can get satisfaction. Nature, 435, 751-752.
152. Gross, D. J. and Mézard, M. (1984). The simplest spin glass. Nucl. Phys., B240 [FS12], 431-452.
153. Grosso, C. (2004). Cavity method analysis for random assignment problems. Tesi di Laurea, Università degli Studi di Milano.
154. Gu, J., Purdom, P. W., Franco, J., and Wah, B. W. (1996). Algorithms for the satisfiability (SAT) problem: A survey. In Satisfiability Problem: Theory and Applications (eds. D. Du, J. Gu, and P. M. Pardalos), pp. 19-151. American Mathematical Society, Providence, RI.
155. Guerra, F. (2003). Broken replica symmetry bounds in the mean field spin glass model. Commun. Math. Phys., 233, 1-12.
156. Guerra, F. (2005). Spin glasses. Eprint arXiv:cond-mat/0507581.
157. Guo, D. and Verdú, S. (2002). Multiuser detection and statistical mechanics. In Communications Information and Network Security (eds. V. Bhargava, H. Poor, V. Tarokh, and S. Yoon), Chapter 13, pp. 229-277. Kluwer Academic, Dordrecht.
158. Hartmann, A. K. and Rieger, H. (eds.) (2002). Optimization Algorithms in Physics. Wiley-VCH, Berlin.
159. Hartmann, A. K. and Rieger, H. (2004). New Optimization Algorithms in Physics. Wiley-VCH, Berlin.
160. Hartmann, A. K. and Weigt, M. (2005). Phase Transitions in Combinatorial Optimization Problems. Wiley-VCH, Weinheim.
161. Hayes, B. (2002). The easiest hard problem. Am. Sci., 90(2), 113-117.
162. Henley, C. L. (1986). Ising domain growth barriers on a Cayley tree at percolation. Phys. Rev. B, 33, 7675-7682.
163. Huang, K. (1987). Statistical Mechanics. Wiley, New York.
164. Janson, S., Luczak, T., and Ruciński, A. (2000). Random Graphs. Wiley, New York.
165. Jaynes, E. T. (1957). Information theory and statistical mechanics. Phys. Rev., 106, 620-630.
166. Jensen, F. V. (ed.) (1996). An Introduction to Bayesian Networks. UCL Press, London.
167. Jerrum, M. and Sinclair, A. (1996). The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Approximation Algorithms for NP-Hard Problems, pp. 482-520. PWS Publishing, Boston, MA.
168. Johnston, D. A. and Plechác, P. (1998). Equivalence of ferromagnetic spin models on trees and random graphs. J. Phys. A, 31, 475-482.
169. Jordan, M. (ed.) (1998). Learning in Graphical Models. MIT Press, Boston, MA.
170. Kabashima, Y. and Saad, D. (1998). Belief propagation vs. TAP for decoding corrupted messages. Europhys. Lett., 44, 668-674.
171. Kabashima, Y. and Saad, D. (1999). Statistical mechanics of error correcting codes. Europhys. Lett., 45, 97-103.
172. Kabashima, Y. and Saad, D. (2000). Error-correcting code on a cactus: A solvable model. Europhys. Lett., 51, 698-704.
173. Kabashima, Y., Murayama, T., and Saad, D. (2000a). Typical performance of Gallager-type error-correcting codes. Phys. Rev. Lett., 84, 1355-1358.
174. Kabashima, Y., Murayama, T., Saad, D., and Vicente, R. (2000b). Regular and irregular Gallager-type error correcting codes. In Advances in Neural Information Processing Systems 12 (eds. S. A. Solla, T. K. Leen, and K. R. Müller). MIT Press, Cambridge, MA.
175. Kanter, I. and Sompolinsky, H. (1987). Mean field theory of spin-glasses with finite coordination number. Phys. Rev. Lett., 58, 164-167.
176. Karmarkar, N. and Karp, R. M. (1982). The differencing method of set partitioning. Technical Report CSD 82/113, University of California, Berkeley.
177. Karmarkar, N., Karp, R. M., Lueker, G. S., and Odlyzko, A. M. (1986). Probabilistic analysis of optimum partitioning. J. Appl. Probab., 23, 626-645.
178. Karónski, M. and Luczak, T. (2002). The phase transition in a random hypergraph. J. Comput. Appl. Math., 142, 125-135.
179. Karp, R. M. (1987). An upper bound on the expected cost of an optimal assignment. In Proc. Japan-U.S. Joint Seminar, New York (eds D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf), Perspectives in Computing, Vol. 15, pp 1-4, Academic Press, Orlando.
180. Katsura, S., Inawashiro, S., and Fujiki, S. (1979). Spin glasses for the infinitely long ranged bond Ising model without the use of the replica method. Physica, 99A, 193-216.
181. Kelly, F. P. (1991). Network routing. Phil. Trans. R. Soc. London A, 337, 343-367.
182. Kikuchi, R. (1951). A theory of cooperative phenomena. Phys. Rev., 81, 988-1003.
183. Kirkpatrick, S. and Selman, B. (1994). Critical behavior in the satisfiability of random boolean expressions. Science, 264, 1297-1301.
184. Kirkpatrick, S. and Sherrington, D. (1978). Infinite ranged models of spin glasses. Phys. Rev. B, 17, 4384-4403.
185. Kirkpatrick, T. R. and Thirumalai, D. (1987). p-spin interaction spin glass models: Connections with the structural glass problem. Phys. Rev. B, 36, 5388-5397.
186. Kirkpatrick, T. R. and Wolynes, P. G. (1987). Connections between some kinetic and equilibrium theories of the glass transition. Phys. Rev. A, 35, 3072-3080.
187. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
188. Kirousis, L. M., Kranakis, E., Krizanc, D., and Stamatiou, Y. (1998). Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms, 12, 253-269.
189. Klein, M. W., Schowalter, L. J., and Shukla, P. (1979). Spin glasses in the Bethe-Peierls-Weiss and other mean field approximations. Phys. Rev. B, 19, 1492-1502.
190. Kleinberg, J. M., Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. S. (1999). TheWeb as a graph: Measurements, models, and methods. In 5th Conference on Computing and Combinatorics, Tokyo, pp. 1-17.
191. Korf, R. E. (1998). A complete anytime algorithm for number partitioning. Artif. Intell., 106, 181:203.
192. Kötter, R. and Vontobel, P. O. (2003). Graph covers and iterative decoding of finitelength codes. In Proc. 3rd Int. Conf. on Turbo Codes and Related Topics, Brest, France, pp. 75-82.
193. Krauth, W. (2006). Statistical Mechanics: Algorithms and Computations. Oxford University Press, Oxford.
194. Krauth, W. and Mézard, M. (1989). The cavity method and the Traveling Salesman Problem. Europhys. Lett., 8, 213-218.
195. Krzakala, F. and Zdeborova, L. (2007). Phase transitions in the coloring of random graphs. Phys. Rev. E, 76, 031131.
196. Krzakala, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., and Zdeborova, L. (2007). Gibbs states and the set of solutions of random constraint satisfaction problems. Proc. Natl. Acad. Sci., 104, 10318-10323.
197. Kschischang, F. R., Frey, B. J., and Loeliger, H.-A. (2001). Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory, 47, 498-519.
198. Lauritzen, S. L. (1996). Graphical Models. Oxford University Press, Oxford.
199. Leone, M., Ricci-Tersenghi, F., and Zecchina, R. (2001). Phase coexistence and finitesize scaling in random combinatorial problems. J. Phys. A, 34, 4615-4626.
200. Leone, M., Vázquez, A., Vespignani, A., and Zecchina, R. (2004). Ferromagnetic ordering in graphs with arbitrary degree distribution. Eur. Phys. J. B, 28, 191-197.
201. Linusson, S. and Wästlund, J. (2004). A proof of Parisi's conjecture on the random assignment problem. Probab. Theory Relat. Fields, 128, 419-440.
202. Litsyn, S. and Shevelev, V. (2003). Distance distributions in ensembles of irregular lowdensity parity-check codes. IEEE Trans. Inf. Theory, 49, 3140-3159.
203. Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D. A., and Stemann, V. (1997). Practical loss-resilient codes. In Proc. 29th ACM Symposium on Theory of Computing, STOC, pp. 150-159.
204. Luby, M., Mitzenmacher, M., Shokrollahi, A., and Spielman, D. A. (1998). Analysis of low density codes and improved designs using irregular graphs. In Proc. 30th ACM Symposium on Theory of Computing, STOC, pp. 249-258.
205. Luby, M., Mitzenmacher, M., Shokrollahi, A., and Spielman, D. A. (2001a). Efficient erasure correcting codes. IEEE Trans. Inf. Theory, 47(2), 569-584.
206. Luby, M., Mitzenmacher, M., Shokrollahi, A., and Spielman, D. A. (2001b). Improved lowdensity parity-check codes using irregular graphs. IEEE Trans. Inf. Theory, 47, 585-598.
207. Ma, S.-K. (1985). Statistical Mechanics. World Scientific, Singapore.
208. MacKay, D. J. C. (1999). Good error correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory, 45, 399-431.
209. MacKay, D. J. C. (2002). Information Theory, Inference & Learning Algorithms. Cambridge University Press, Cambridge.
210. MacKay, D. J. C. and Neal, R. M. (1996). Near Shannon limit performance of low density parity check codes. Electron. Lett., 32, 1645-1646.
211. MacKay, D. J. C. and Postol, M. S. (2003). Weaknesses of Margulis and Ramanujan-Margulis low-density parity check codes. Elect. Notes in Theor. Computer Sci., 74, 97-104.
212. Macris, N. (2007). Sharp bounds on generalised EXIT function. IEEE Trans. Inf. Theory, 53, 2365-2375.
213. Maneva, E., Mossel, E., and Wainwright, M. J. (2005). A new look at survey propagation and its generalizations. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, SODA, Vancouver, pp. 1089-1098.
214. Marinari, E., Parisi, G., and Ruiz-Lorenzo, J. (1997). Numerical simulations of spin glass systems. In Spin Glasses and Random Fields (ed. A. Young). World Scientific, Singapore.
215. Martin, O. C., Mézard, M., and Rivoire, O. (2005). Random multi-index matching problems. J. Stat. Mech., 09006.
216. Martinelli, F. (1999). Lectures on Glauber dynamics for discrete spin models. In Lectures on Probability Theory and Statistics, Saint-Flour 1997, Lecture Notes in Mathematics, pp. 93-191. Springer, Berlin.
217. Martinelli, F., Sinclair, A., and Weitz, D. (2004). Glauber dynamics on trees: Boundary conditions and mixing time. Commun. Math. Phys, 250, 301-334.
218. McEliece, R. J., MacKay, D. J. C., and Cheng, J.-F. (1998). Turbo decoding as an instance of Pearl's 'belief propagation' algorithm. IEEE J. Sel. Areas Commun., 16, 140-152.
219. Méasson, C., Montanari, A., and Urbanke, R. (2008). Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding. IEEE Trans. Inf. Theory, 54, 5277-5307.
220. Méasson, C., Montanari, A., Richardson, T., and Urbanke, R. (2005). The generalized area theorem and some of its consequences. Submitted. Eprint .
221. Mertens, S. (1998). Phase transition in the number partitioning problem. Phys. Rev. Lett., 81(20), 4281-4284.
222. Mertens, S. (2000). Random costs in combinatorial optimization. Phys. Rev. Lett., 84(7), 1347-1350.
223. Mertens, S. (2001). A physicist's approach to number partitioning. Theor. Comput. Sci., 265, 79-108.
224. Mertens, S., Mézard, M., and Zecchina, R. (2006). Threshold values of random KSAT from the cavity method. Random Struct. Algorithms, 28, 340-373.
225. Mézard, M. and Montanari, A. (2006). Reconstruction on trees and spin glass transition. J. Stat. Phys., 124, 1317-1350.
226. Mézard, M. and Parisi, G. (1985). Replicas and optimization. J. Physique Lett., 46, L771-L778.
227. Mézard, M. and Parisi, G. (1986). Mean-field equations for the matching and the traveling salesman problems. Europhys. Lett., 2, 913-918.
228. Mézard, M. and Parisi, G. (1987). Mean-field theory of randomly frustrated systems with finite connectivity. Europhys. Lett., 3, 1067-1074.
229. Mézard, M. and Parisi, G. (1999). Thermodynamics of glasses: A first principles computation. Phys. Rev. Lett., 82, 747-751.
230. Mézard, M. and Parisi, G. (2001). The Bethe lattice spin glass revisited. Eur. Phys. J. B, 20, 217-233.
231. Mézard, M. and Parisi, G. (2003). The cavity method at zero temperature. J. Stat. Phys., 111, 1-34.
232. Mézard, M. and Zecchina, R. (2002). The random K-satisfiability problem: From an analytic solution to an efficient algorithm. Phys. Rev. E, 66, 056126.
233. Mézard, M., Parisi, G., and Virasoro, M. A. (1985a). Random free energies in spin glasses. J. Physique Lett., 46, L217-L222.
234. Mézard, M., Parisi, G., and Virasoro, M. A. (1985b). SK model: The replica solution without replicas. Europhys. Lett., 1, 77-82.
235. Mézard, M., Parisi, G., Sourlas, N., Toulouse, G., and Virasoro, M. A. (1985c). Replica symmetry breaking and the nature of the spin glass phase. J. Physique, 45, 843-854.
236. Mézard, M., Parisi, G., and Virasoro, M. A. (1987). Spin Glass Theory and Beyond. World Scientific, Singapore.
237. Mézard, M., Parisi, G., and Zecchina, R. (2003a). Analytic and algorithmic solution of random satisfiability problems. Science, 297, 812-815.
238. Mézard, M., Ricci-Tersenghi, F., and Zecchina, R. (2003b). Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys., 111, 505-533.
239. Mézard, M., Mora, T., and Zecchina, R. (2005a). Clustering of solutions in the random satisfiability problem. Phys. Rev. Lett., 94, 197205.
240. Mézard, M., Palassini, M., and Rivoire, O. (2005b). Landscape of solutions in constraint satisfaction problems. Phys. Rev. Lett., 95, 200202.
241. Mézard, M., Tarzia, M., and Toninelli, C. (2007). Statistical physics of group testing. J. Phys. A, 40, 12019-12029. Proc. International Workshop on Statistical-Mechanical Informatics, Kyoto.
242. Migliorini, G. and Saad, D. (2006). Finite-connectivity spin-glass phase diagrams and lowdensity parity check codes. Phys. Rev. E, 73, 026122.
243. Molloy, M. and Reed, B. (1995). A critical point for random graphs with a given degree sequence. Random Struct. Algorithms, 6, 161-180.
244. Monasson, R. (1995). Structural glass transition and the entropy of metastable states. Phys. Rev. Lett., 75, 2847-2850.
245. Monasson, R. (1998). Optimization problems and replica symmetry breaking in finite connectivity spin glasses. J. Phys. A, 31, 513-529.
246. Monasson, R. and Zecchina, R. (1996). Entropy of the K-satisfiability problem. Phys. Rev. Lett., 76, 3881-3885.
247. Monasson, R. and Zecchina, R. (1997). Statistical mechanics of the random Ksatisfiability problem. Phys. Rev. E, 56, 1357-1370.
248. Monasson, R. and Zecchina, R. (1998). Tricritical points in random combinatorics: The (2 + p)-sat case. J. Phys. A, 31, 9209-9217.
249. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., and Troyansky, L. (1999). Determining computational complexity from characteristic phase transitions. Nature, 400, 133-137.
250. Monod, P. and Bouchiat, H. (1982). Equilibrium magnetization of a spin glass: is mean-field theory valid? J. Physique Lett., 43, 45-54.
251. Montanari, A. (2000). Turbo codes: The phase transition. Eur. Phys. J. B, 18, 121-136.
252. Montanari, A. (2001a). Finite size scaling and metastable states of good codes. In Proc. 39th Allerton Conference on Communications, Control and Computing, Monticello, IL.
253. Montanari, A. (2001b). The glassy phase of Gallager codes. Eur. Phys. J. B, 23, 121-136.
254. Montanari, A. (2003). 2RSB population dynamics for spin glasses. Unpublished.
255. Montanari, A. (2005). Tight bounds for LDPC and LDGM codes under MAP decoding. IEEE Trans. Inf. Theory, 51, 3221-3246.
256. Montanari, A. and Ricci-Tersenghi, F. (2003). On the nature of the low-temperature phase in discontinuous mean-field spin glasses. Eur. Phys. J. B, 33, 339-346.
257. Montanari, A. and Ricci-Tersenghi, F. (2004). Cooling-schedule dependence of the dynamics of mean-field glasses. Phys. Rev. B, 70, 134406.
258. Montanari, A. and Semerjian, G. (2005). From large scale rearrangements to mode coupling phenomenology in model glasses. Phys. Rev. Lett., 94, 247201.
259. Montanari, A. and Semerjian, G. (2006a). On the dynamics of the glass transition on Bethe lattices. J. Stat. Phys., 124, 103-189.
260. Montanari, A. and Semerjian, G. (2006b). Rigorous inequalities between length and time scales in glassy systems. J. Stat. Phys., 125, 23-54.
261. Montanari, A. and Shah, D. (2007). Counting good truth assignments for random satisfiability formulae. In Proc. 18th Symposium on Discrete Algorithms, SODA, New Orleans, pp. 1255-1265.
262. Montanari, A. and Sourlas, N. (2000). The statistical mechanics of turbo codes. Eur. Phys. J. B, 18, 107-119.
263. Montanari, A., Parisi, G., and Ricci-Tersenghi, F. (2004). Instability of one-step replicasymmetry breaking in satisfiability problems. J. Phys. A, 37, 2073-2091.
264. Montanari, A., Ricci-Tersenghi, F., and Semerjian, G. (2007). Solving constraint satisfaction problems through belief-propagation-guided decimation. In Proc. 45th Allerton Conference on Communications, Control and Computing, Monticello, IL.
265. Montanari, A., Ricci-Tersenghi, F., and Semerjian, G. (2008). Cluster of solutions and replica symmetry breaking in random k-satisfiability. J. Stat. Mech., 04004.
266. Mooij, J. M. and Kappen, H. K. (2005). On the properties of Bethe aproximation and loopy belief propagation on binary networks. J. Stat. Mech., 11012.
267. Mora, T. and Mézard, M. (2006). Geometrical organization of solutions to random linear Boolean equations. J. Stat. Mech., 10007.
268. Mora, T. and Zdeborová, L. (2007). Random subcubes as a toy model for constraint satisfaction problems. Eprint arXiv:0710.3804.
269. Morita, T. (1979). Variational principle for the distribution function of the effective field for the random Ising model in the Bethe approximation. Physica, 98A, 566-572.
270. Mossel, E. (2003). Phase transitions in phylogeny. Trans. Am. Math. Soc., 356, 2379-2404.
271. Mossel, E. (2004). Survey: Information flow on trees. In Graphs, Morphisms, and Statistical Physics, pp. 155-170. American Mathematical Society, Providence, RI.
272. Mossel, E. and Peres, Y. (2003). Information flow on trees. Ann. Appl. Probab., 13, 817-844.
273. Mottishaw, P. and De Dominicis, C. (1987). On the stability of randomly frustrated systems with finite connectivity. J. Phys. A, 20, L375-L379.
274. Mulet, R., Pagnani, A., Weigt, M., and Zecchina, R. (2002). Coloring random graphs. Phys. Rev. Lett., 89, 268701.
275. Nair, C., Prabhakar, B., and Sharma, M. (2003). Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem. In Proc. 44th IEEE Symposium on Foundations of Computer Science, FOCS, pp. 168-178.
276. Nair, C., Prabhakar, B., and Sharma, M. (2006). Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Struct. Algorithms, 27, 413-444.
277. Nakamura, K., Kabashima, Y., and Saad, D. (2001). Statistical mechanics of lowdensity parity check error-correcting codes over Galois fields. Europhys. Lett., 56, 610-616.
278. Nakanishi, K. (1981). Two-and three-spin cluster theory of spin glasses. Phys. Rev. B, 23, 3514-3522.
279. Neri, I., Skantzos, N. S., and Bollé, D. (2008). Gallager error correcting codes for binary asymmetric channels. Eprint arXiv:0803.2580.
280. Nishimori, H. (2001). Statistical Physics of Spin Glasses and Information Processing. Oxford University Press, Oxford.
281. Norris, J. R. (1997). Markov Chains. Cambridge University Press, Cambridge.
282. Panchenko, D. and Talagrand, M. (2004). Bounds for diluted mean-field spin glass models. Probab. Theor. Relat. Fields, 130, 319-336.
283. Papadimitriou, C. H. (1991). On selecting a satisfying truth assignment. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, FOCS, pp. 163-169.
284. Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley, Reading, MA.
285. Papadimitriou, C. H. and Steiglitz, K. (1998). Combinatorial Optimization. Dover Publications, Mineola, NY.
286. Parisi, G. (1979). Toward a mean field theory for spin glasses. Phys. Lett., 73A, 203-205.
287. Parisi, G. (1980a). A sequence of approximated solutions to the SK model for spin glasses. J. Phys. A, 13, L115-L121.
288. Parisi, G. (1980b). The order parameter for spin glasses: A function on the interval [0, 1]. J. Phys. A, 13, 1101-1112.
289. Parisi, G. (1983). Order parameter for spin glasses. Phys. Rev. Lett., 50, 1946-1948.
290. Parisi, G. (1988). Statistical Field Theory. Addison-Wesley, Reading, MA.
291. Parisi, G. (1998). A conjecture on random bipartite matching. Eprint arXiv:condmat/9801176.
292. Parisi, G. (2002). On local equilibrium equations for clustering states. Eprint arXiv:cs/0212047v1.
293. Parisi, G. (2003). A backtracking survey propagation algorithm for K-satisfiability. Eprint arxiv:cond-mat/0308510.
294. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco.
295. Pitman, J. and Yor, M. (1997). The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator. Ann. Probab., 25, 855-900.
296. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell Syst. Tech. J., 36, 1389-1401.
297. Pumphrey, S. J. (2001). Solving the satisfiability problem using message passing techniques. Part III Physics Project Report, Department of Physics, University of Cambridge.
298. Reif, F. (1965). Fundamentals of Statistical and Thermal Physics. McGraw-Hill, New York.
299. Ricci-Tersenghi, F., Weigt, M., and Zecchina, R. (2001). Exact solutions for diluted spin glasses and optimization problems. Phys. Rev. E, 63, 026702.
300. Richardson, T. J. (2003). Error floors of LDPC codes. In Proc. 41st Allerton Conference on Communications, Control and Computing, Monticello, IL.
301. Richardson, T. and Urbanke, R. (2001a). An introduction to the analysis of iterative coding systems. In Codes, Systems, and Graphical Models, IMA Volumes in Mathematics and Its Applications, Vol. 123, pp. 1-37. Springer, Berlin.
302. Richardson, T. J. and Urbanke, R. (2001b). The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inf. Theory, 47, 599-618.
303. Richardson, T. J. and Urbanke, R. (2001c). Efficient encoding of low-density paritycheck codes. IEEE Trans. Inf. Theory, 47, 638-656.
304. Richardson, T. J. and Urbanke, R. (2008). Modern Coding Theory. Cambridge University Press, Cambridge. Available online at .
305. Richardson, T. J., Shokrollahi, A., and Urbanke, R. (2001). Design of capacityapproaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory, 47, 610-637.
306. Rivoire, O., Biroli, G., Martin, O. C., and Mézard, M. (2003). Glass models on Bethe lattices. Eur. Phys. J. B, 37, 55-78.
307. Ruelle, D. (1987). A mathematical reformulation of Derrida's REM and GREM. Commun. Math. Phys., 108, 225-239.
308. Ruelle, D. (1999). Statistical Mechanics: Rigorous Results. World Scientific, Singapore.
309. Rujan, P. (1993). Finite temperature error-correcting codes. Phys. Rev. Lett., 70, 2968-2971.
310. Schmidt-Pruzan, J. and Shamir, E. (1985). Component structure in the evolution of random hypergraphs. Combinatorica, 5, 81-94.
311. Schöning, U. (1999). A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proc. 40th IEEE Symposium on Foundations of Computer Science, FOCS, New York, pp. 410-414.
312. Schöning, U. (2002). A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica, 32, 615-623.
313. Selman, B. and Kautz, H. A. (1993). Domain independent extensions to gsat: Solving large structural satisfiability problems. In Proc. IJCAI-93, Chambery, France.
314. Selman, B. and Kirkpatrick, S. (1996). Critical behavior in the computational cost of satisfiability testing. Artif. Intell., 81, 273-295.
315. Selman, B., Kautz, H. A., and Cohen, B. (1994). Noise strategies for improving local search. In Proc. AAAI-94, Seattle, WA.
316. Selman, B., Mitchell, D., and Levesque, H. (1996). Generating hard satisfiability problems. Artif. Intell., 81, 17-29.
317. Shannon, C. E. (1948). A mathematical theory of communication. Bell Syst. Tech. J., 27, 379-423, 623-655. Available online at
318. Sherrington, D. and Kirkpatrick, S. (1975). Solvable model of a spin glass. Phys. Rev. Lett., 35, 1792-1796.
319. Shohat, J. A. and Tamarkin, J. D. (1943). The Problem of Moments, Mathematical Surveys No. 1. American Mathematical Society, New York.
320. Sinclair, A. (1997). Convergence rates for Monte Carlo experiments. In Numerical Methods for Polymeric Systems, IMA Volumes in Mathematics and Its Applications, Vol. 102, pp. 1-18. Springer, Berlin.
321. Sipser, M. and Spielman, D. A. (1996). Expander codes. IEEE Trans. Inf. Theory, 42, 1710-1722.
322. Sokal, A. D. (1996). Monte Carlo methods in statistical mechanics: foundations and new algorithms. In Lectures at the Cargèse Summer School 'Functional Integration: Basics and Applications'. Available online at .
323. Sourlas, N. (1989). Spin-glass models as error-correcting codes. Nature, 339, 693.
324. Spielman, D. A. (1997). The complexity of error-correcting codes. In Fundamentals of Computation Theory (eds Chlebus, B. S. and Craja, L.), Lecture Notes in Computer Science, Vol. 1279, pp. 67-84. Springer, Berlin.
325. Sportiello, A. (2004). Personal communication.
326. Stepanov, M. G., Chernyak, V. Y., Chertkov, M., and Vasic, B. (2005). Diagnosis of weaknesses in modern error correction codes: A physics approach. Phys. Rev. Lett., 95, 228701-228704.
327. Svenson, P. and Nordahl, M. G. (1999). Relaxation in graph coloring and satisfiability problems. Phys. Rev. E, 59, 3983-3999.
328. Talagrand, M. (2000). Rigorous low temperature results for the mean field p-spin interaction model. Probab. Theor. Relat. Fields, 117, 303-360.
329. Talagrand, M. (2003). Spin Glasses: A Challenge for Mathematicians. Springer, Berlin.
330. Tanaka, T. (2002). A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors. IEEE Trans. Inf. Theory, 48, 2888-2910.
331. Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Trans. Inf. Theory, 27, 533-547.
332. Thouless, D. J. (1986). Spin-glass on a Bethe lattice. Phys. Rev. Lett., 6, 1082-1085.
333. Thouless, D. J., Anderson, P. W., and Palmer, R. G. (1977). Solution of 'Solvable model of a spin glass'. Phil. Mag., 35, 593-601.
334. Toulouse, G. (1977). Theory of the frustration effect in spin glasses: I. Comm. Phys., 2, 115-119.
335. Viana, L. and Bray, A. J. (1985). Phase diagrams for dilute spin glasses. J. Phys. C, 18, 3037-3051.
336. Wainwright, M. J. and Maneva, E. (2005). Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. In IEEE International Symposium on Information Theory, Adelaide, pp. 1493-1497.
337. Wainwright, M. J., Jaakkola, T. S., and Willsky, A. S. (2005a). A new class of upper bounds on the log partition function. IEEE Trans. Inf. Theory, 51(7), 2313-2335.
338. Wainwright, M. J., Jaakkola, T. S., and Willsky, A. S. (2005b). MAP estimation via agreement on trees: Message-passing and linear programming. IEEE Trans. Inf. Theory, 51(11), 3697-3717.
339. Walkup, D. W. (1979). On the expected value of a random assignment problem. SIAM J. Comput., 8, 440-442.
340. Wang, C. C., Kulkarni, S. R., and Poor, H. V. (2006). Exhausting errorprone patterns in ldpc codes. IEEE Trans. Inf. Theory, submitted. Eprint
341. Wästlund, J. (2008). An easy proof of the ζ(2) limit in the random assignment problem. Electron. Commmun. Probab., 13, 258-265.
342. Weigt, M. and Hartmann, A. K. (2000). Number of guards needed by a museum: A phase transition in vertex covering of random graphs. Phys. Rev. Lett, 84, 6118-6121.
343. Wong, K. Y. M. and Sherrington, D. (1988). Intensively connected spin glasses: Towards a replica symmetry breaking solution of the ground state. J. Phys. A, 21, L459-L466.
344. Wormald, N. C. (1999). Models of random regular graphs. In Surveys in Combinatorics, 1999 (eds. J. D. Lamb and D. A. Preece), London Mathematical Society Lecture Note Series, pp. 239-298. Cambridge University Press, Cambridge.
345. Yakir, B. (1996). The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp. Math. Oper. Res., 21, 85.
346. Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2001). Generalized belief propagation. In Advances in Neural Information Processing Systems, NIPS, pp. 689-695. MIT Press, Cambridge, MA.
347. Yedidia, J. S., Freeman, W. T., and Weiss, Y. (2005). Constructing free energy approximations and generalized belief propagation algorithms. IEEE Trans. Inf. Theory, 51, 2282-2313.
348. Yuille, A. L. (2002). CCCP algorithms to minimize the Bethe and Kikuchi free energies: Convergent alternatives to belief propagation. Neural Comput., 14, 691-1722.
349. Zhou, H. (2003). Vertex cover problem studied by cavity method: Analytics and population dynamics. Eur. Phys. J. B, 32, 265-270.