Fetching the paper…
Reading the bibliography…
Mean-field spin glasses are families of random energy functions (Hamiltonians) on high-dimensional product spaces.
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, Giorgio Parisi, and Miguel A. Virasoro, Spin glass theory and beyond , World Scientific, 1987
1987
Earlier work this paper cites.
Andrea Crisanti and H-J Sommers, The sphericalp-spin interaction spin glass model: the statics , Zeitschrift für Physik B Condensed Matter 87
1992
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.
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky, Determining computational complexity from characteristic ‘phase transitions’ , Nature 400
1999
Earlier work this paper cites.
Francesco Guerra, Sum rules for the free energy in the mean field spin glass model , Fields Institute Communications 30
2001
Earlier work this paper cites.
2001
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.
Andrea Crisanti, Luca Leuzzi, and Tommaso Rizzo, The complexity of the spherical p p -spin spin glass model, revisited , The European Physical Journal B-Condensed Matter and Complex Systems 36
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, The Parisi formula , Annals of Mathematics (2006), 221–263
2006
Earlier work this paper cites.
Florent Krzakala, Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian, and Lenka Zdeborová, Gibbs states and the set of solutions of random constraint satisfaction problems , Proceedings of the National Academy of Sciences 104
2007
Earlier work this paper cites.
Lawrence C. Evans, Partial differential equations , Springer, 2009
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.
Boaz Barak, Fernando GSL Brandao, Aram W Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou, Hypercontractivity, sum-of-squares proofs, and their applications , Proceedings of the forty-fourth annual ACM symposium on Theory of computing, ACM, 2012, pp. 307–326
2012
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.
2016
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Auffinger, Antonio and Ben Arous, Gérard and Cernỳ, Jirí, Random matrices and complexity of spin glasses , Communications on Pure and Applied Mathematics 66
2013
Cited alongside, same era.
Wei-Kuo Chen, The Aizenman-Sims-Starr scheme and Parisi formula for mixed p p -spin spherical models , Electronic Journal of Probability 18
2013
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.
Bernt Oksendal, Stochastic differential equations: an introduction with applications , Springer Science & Business Media, 2013
2013
Cited alongside, same era.
Dmitry Panchenko, The Parisi ultrametricity conjecture , Annals of Mathematics (2013), 383–393
2013
Cited alongside, same era.
Erwin Bolthausen, An iterative construction of solutions of the TAP equations for the Sherrington–Kirkpatrick model , Communications in Mathematical Physics 325
2014
Cited alongside, same era.
David Gamarnik and Madhu Sudan, Limits of local algorithms over sparse random graphs , Proceedings of the 5th conference on Innovations in theoretical computer science, ACM, 2014, pp. 369–376
2014
Cited alongside, same era.
2018
Later among the works it cites.
Eliran Subag, Following the ground-states of full-RSB spherical spin glasses , arXiv:1812.04588
2018
Later among the works it cites.
Raphaël Berthier, Andrea Montanari, and Phan-Minh Nguyen, State evolution for approximate message passing with non-separable functions , Information and Inference: A Journal of the IMA (2019)
2019
Later among the works it cites.
Wei-Kuo Chen, David Gamarnik, Dmitry Panchenko, Mustazee Rahman, et al., Suboptimality of local algorithms for a class of max-cut problems , The Annals of Probability 47
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Andrea Montanari, Optimization of the Sherrington-Kirkpatrick Hamiltonian , IEEE Symposium on the Foundations of Computer Science, FOCS, November 2019
2019
Later among the works it cites.