Fetching the paper…
Reading the bibliography…
Let ${\boldsymbol A}\in{\mathbb R}^{n\times n}$ be a symmetric random matrix with independent and identically distributed Gaussian entries above the diagonal.
David Sherrington and Scott Kirkpatrick, Solvable model of a spin-glass , Physical review letters 35
1975
Earlier work this paper cites.
Giorgio Parisi, Infinite number of order parameters for spin-glasses , Physical Review Letters 43
1979
Earlier work this paper cites.
Marc Mézard and Miguel Angel Virasoro, The microstructure of ultrametricity , Journal de Physique 46
1985
Earlier work this paper cites.
Marc Mézard, Giorgio Parisi, and Miguel A. Virasoro, Spin glass theory and beyond , World Scientific, 1987
1987
Earlier work this paper cites.
Leticia F. Cugliandolo and Jorge Kurchan, On the out-of-equilibrium relaxation of the sherrington-kirkpatrick model , Journal of Physics A: Mathematical and General 27
1994
Earlier work this paper cites.
Jean-Philippe Bouchaud, Leticia F Cugliandolo, Jorge Kurchan, and Marc Mézard, Out of equilibrium dynamics in spin-glasses and other glassy systems , Spin glasses and random fields (1998), 161–223
1998
Earlier work this paper cites.
Andreas Engel and Christian Van den Broeck, Statistical mechanics of learning , Cambridge University Press, 2001
2001
Earlier work this paper cites.
Hidetoshi Nishimori, Statistical Physics of Spin Glasses and Information Processing: An Introduction , Oxford University Press, 2001
2001
Earlier work this paper cites.
Andrea Crisanti and Tommaso Rizzo, Analysis of the ∞ \infty -replica symmetry breaking solution of the Sherrington-Kirkpatrick model , Physical Review E 65
2002
Earlier work this paper cites.
Marc Mézard, Giorgio Parisi, and Riccardo Zecchina, Analytic and algorithmic solution of random satisfiability problems , Science 297
2002
Earlier work this paper cites.
Francesco Guerra, Broken replica symmetry bounds in the mean field spin glass model , Communications in mathematical physics 233
2003
Earlier work this paper cites.
Yoshiyuki Kabashima, A CDMA multiuser detection algorithm on the basis of belief propagation , J. Phys. A 36
2003
Earlier work this paper cites.
Bernt Øksendal, Stochastic differential equations , Stochastic differential equations, Springer, 2003, pp. 65–84
2003
Earlier work this paper cites.
Sanjeev Arora, Eli Berger, Hazan Elad, Guy Kindler, and Muli Safra, On non-approximability for quadratic programs , Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, IEEE, 2005, pp. 206–215
2005
Earlier work this paper cites.
Michel Talagrand, Parisi measures , Journal of Functional Analysis 231
2006
Earlier work this paper cites.
Reinhold Oppermann, Manuel J Schmidt, and David Sherrington, Double Criticality of the Sherrington-Kirkpatrick Model at T = 0 T=0 , Physical Review Letters 98
2007
Cited alongside, same era.
Manuel J Schmidt, Replica symmetry breaking at low temperatures , Ph.F. Thesis, 2008
2008
Cited alongside, same era.
Manuel J Schmidt and Reinhold Oppermann, Method for replica symmetry breaking at and near T= 0 with application to the Sherrington-Kirkpatrick model , Physical Review E 77
2008
Cited alongside, same era.
Cédric Villani, Optimal transport: old and new , vol. 338, Springer Science & Business Media, 2008
2008
Cited alongside, same era.
Greg W. Anderson, Alice Guionnet, and Ofer Zeitouni, An introduction to random matrices , Cambridge University Press, 2009
2009
Cited alongside, same era.
Antonio Auffinger and Wei-Kuo Chen, The Parisi formula has a unique minimizer , Communications in Mathematical Physics 335
2015
Later among the works it cites.
Mohsen Bayati, Marc Lelarge, and Andrea Montanari, Universality in polytope phase transitions and message passing algorithms , The Annals of Applied Probability 25
2015
Later among the works it cites.
Aukosh Jagannath and Ian Tobasco, A dynamic programming approach to the parisi functional , Proceedings of the American Mathematical Society 144
2016
Later among the works it cites.
Andrea Montanari, Local algorithms for two problems on locally tree-like graphs , https://simons.berkeley.edu/talks/andrea-montanari-02-22-2016
2016
Later among the works it cites.
Andrea Montanari and Subhabrata Sen, Semidefinite programs on sparse random graphs and their application to community detection , Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, ACM, 2016, pp. 814–827
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David L. Donoho, Arian Maleki, and Andrea Montanari, Message Passing Algorithms for Compressed Sensing , Proceedings of the National Academy of Sciences 106
2009
Cited alongside, same era.
Marc Mézard and Andrea Montanari, Information, Physics and Computation , Oxford, 2009
2009
Cited alongside, same era.
Michel Talagrand, Mean field models for spin glasses: Volume i , Springer-Verlag, Berlin, 2010
2010
Cited alongside, same era.
Mohsen Bayati and Andrea Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing , IEEE Trans. on Inform. Theory 57
2011
Cited alongside, same era.
2012
Cited alongside, same era.
Adel Javanmard and Andrea Montanari, State evolution for general approximate message passing algorithms, with applications to spatial coupling , Information and Inference: A Journal of the IMA 2
2013
Cited alongside, same era.
Dmitry Panchenko, The Parisi ultrametricity conjecture , Annals of Mathematics (2013), 383–393
2013
Cited alongside, same era.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Wei-Kuo Chen, Variational representations for the Parisi functional and the two-dimensional Guerra–Talagrand bound , The Annals of Probability 45
2017
Later among the works it cites.
Amir Dembo, Andrea Montanari, and Subhabrata Sen, Extremal cuts of sparse random graphs , The Annals of Probability 45
2017
Later among the works it cites.
2018
Closest in time.
Wei-Kuo Chen, Dmitry Panchenko, and Eliran Subag, The generalized TAP free energy , arXiv:1812.05066
2018
Closest in time.
2018
Closest in time.