Fetching the paper…
Reading the bibliography…
We study the Ising pure $p$-spin model for large $p$.
Jack Sherman and Winifred J Morrison, Adjustment of an inverse matrix corresponding to a change in one element of a given matrix , The Annals of Mathematical Statistics 21
1950
Earlier work this paper cites.
AJ Hoffman and HW Wielandt, The variation of the spectrum of a normal matrix , Duke Mathematical Journal 20
1953
Earlier work this paper cites.
I Richard Savage, Mills’ ratio for multivariate normal distributions , J. Res. Nat. Bur. Standards Sect. B 66
1962
Earlier work this paper cites.
David Slepian, The one-sided barrier problem for Gaussian noise , Bell System Technical Journal 41
1962
Earlier work this paper cites.
Robert G Gallager, Information theory and reliable communication , vol. 588, Springer, 1968
1968
Earlier work this paper cites.
David Sherrington and Scott Kirkpatrick, Solvable model of a spin-glass , Physical review letters 35
1975
Earlier work this paper cites.
Bernard Derrida, Random-energy model: Limit of a family of disordered models , Physical Review Letters 45
1980
Earlier work this paper cites.
Theodore R Kirkpatrick and Devarajan Thirumalai, p-spin-interaction spin-glass models: Connections with the structural glass problem , Physical Review B 36
1987
Earlier work this paper cites.
Alan M Frieze and T Łuczak, On the independence and chromatic numbers of random regular graphs , Journal of Combinatorial Theory, Series B 54
1992
Earlier work this paper cites.
Miklós Ajtai, Generating hard instances of lattice problems , Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996, pp. 99–108
1996
Earlier work this paper cites.
Michel Talagrand, Rigorous low-temperature results for the mean field p-spins interaction model , Probability theory and related fields 117
2000
Earlier work this paper cites.
Fabio Lucio Toninelli, About the almeida-thouless transition line in the sherrington-kirkpatrick mean-field spin glass model , Europhysics letters 60
2002
Earlier work this paper cites.
Michael Aizenman, Robert Sims, and Shannon L Starr, Extended variational principle for the sherrington-kirkpatrick spin-glass model , Physical Review B 68
2003
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.
Enkelejd Hashorva and Jürg Hüsler, On multivariate gaussian tails , Annals of the Institute of Statistical Mathematics 55
2003
Earlier work this paper cites.
Enkelejd Hashorva, Asymptotics and bounds for multivariate gaussian tails , Journal of theoretical probability 18
2005
Earlier work this paper cites.
Marc Mézard, Thierry Mora, and Riccardo Zecchina, Clustering of solutions in the random satisfiability problem , Physical Review Letters 94
2005
Earlier work this paper cites.
Dimitris Achlioptas and Federico Ricci-Tersenghi, On the solution-space geometry of random constraint satisfaction problems , Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, 2006, pp. 130–139
2006
Earlier work this paper cites.
Florent Krzakała, 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.
Dimitris Achlioptas and Amin Coja-Oghlan, Algorithmic barriers from phase transitions , 2008 49th Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2008, pp. 793–802
2008
Cited alongside, same era.
Louis-Pierre Arguin, A remark on the infinite-volume gibbs measures of spin glasses , Journal of mathematical physics 49
2008
Cited alongside, same era.
Anton Bovier and Irina Kurkova, A short course on mean field spin glasses , Spin Glasses: Statics and Dynamics: Summer School, Paris 2007, Springer, 2009, pp. 3–44
2009
Cited alongside, same era.
Mohsen Bayati, David Gamarnik, and Prasad Tetali, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs , Proceedings of the forty-second ACM symposium on Theory of computing, 2010, pp. 105–114
2010
Cited alongside, same era.
Louigi Addario-Berry and Pascal Maillard, The algorithmic hardness threshold for continuous random energy models , Mathematical Statistics and Learning 2
2020
Later among the works it cites.
David Gamarnik, Aukosh Jagannath, and Alexander S Wein, Low-degree hardness of random optimization problems , 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2020, pp. 131–140
2020
Later among the works it cites.
2021
Later among the works it cites.
Enric Boix-Adserà, Matthew Brennan, and Guy Bresler, The average-case complexity of counting cliques in Erdös–Rényi hypergraphs , SIAM Journal on Computing (2021), no. 0, FOCS19–39
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dimitris Achlioptas, Amin Coja-Oghlan, and Federico Ricci-Tersenghi, On the solution-space geometry of random constraint satisfaction problems , Random Structures & Algorithms 38
2011
Cited alongside, same era.
Roger A Horn and Charles R Johnson, Matrix analysis , Cambridge University Press, 2012
2012
Cited alongside, same era.
Antonio Auffinger, Gérard Ben Arous, and Jiří Černỳ, Random matrices and complexity of spin glasses , Communications on Pure and Applied Mathematics 66
2013
Cited alongside, same era.
Dmitry Panchenko, The parisi ultrametricity conjecture , Annals of Mathematics (2013), 383–393
2013
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, 2014, pp. 369–376
2014
Cited alongside, same era.
Dmitry Panchenko, The Parisi formula for mixed p p -spin models , The Annals of Probability 42
2014
Cited alongside, same era.
Antonio Auffinger and Wei-Kuo Chen, On properties of parisi measures , Probability Theory and Related Fields 161
2015
Cited alongside, same era.
Or Ordentlich and Ofer Shayevitz, Minimum ms. e. gerber’s lemma , IEEE Transactions on Information Theory 61
2015
Cited alongside, same era.
2021
Later among the works it cites.
David Gamarnik, The overlap gap property: A topological barrier to optimizing over random structures , Proceedings of the National Academy of Sciences 118
2021
Later among the works it cites.
David Gamarnik and Aukosh Jagannath, The overlap gap property and approximate message passing algorithms for p p -spin models , The Annals of Probability 49
2021
Later among the works it cites.
2021
Later among the works it cites.
David Gamarnik and Eren C. Kızıldağ, Computing the partition function of the Sherrington–Kirkpatrick model is hard on average , The Annals of Applied Probability 31
2021
Later among the works it cites.
Mark Sellke, Approximate ground states of hypercube spin glasses are near corners , Comptes Rendus. Mathématique 359
2021
Later among the works it cites.
Guy Bresler and Brice Huang, The algorithmic phase transition of random k-sat for low degree polynomials , 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2022, pp. 298–309
2022
Later among the works it cites.
David Gamarnik, Eren C Kızıldağ, Will Perkins, and Changji Xu, Algorithms and barriers in the symmetric binary perceptron model , 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2022, pp. 576–587
2022
Later among the works it cites.
David Gamarnik, Cristopher Moore, and Lenka Zdeborová, Disordered systems insights on computational hardness , Journal of Statistical Mechanics: Theory and Experiment 2022
2022
Later among the works it cites.
Brice Huang and Mark Sellke, Tight lipschitz hardness for optimizing mean field spin glasses , 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2022, pp. 312–322
2022
Later among the works it cites.
Dmitriy Kunisky, Alexander S Wein, and Afonso S Bandeira, Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio , Mathematical Analysis, its Applications and Computation: ISAAC 2019, Aveiro, Portugal, July 29–August 2, Springer, 2022, pp. 1–50
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Closest in time.
Wei-Kuo Chen, Dmitry Panchenko, and Eliran Subag, Generalized tap free energy , Communications on Pure and Applied Mathematics 76
2023
Closest in time.