Fetching the paper…
Reading the bibliography…
Statistical inference problems arising within signal processing, data mining, and machine learning naturally give rise to hard combinatorial optimization problems.
G Toulouse, On the mean field theory of mixed spin glass-ferromagnetic phases , Journal de Physique Lettres 41
1980
Earlier work this paper cites.
K. Binder, Finite size scaling analysis of ising model block distribution functions , Zeitschrift für Physik B Condensed Matter 43
1981
Earlier work this paper cites.
P. W. Holland, K. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps , Social Networks 5
1983
Earlier work this paper cites.
H-J Sommers, Properties of sompolinsky’s mean field theory of spin glasses , Journal of Physics A: Mathematical and General 16
1983
Earlier work this paper cites.
Jayanth R Banavar, David Sherrington, and Nicolas Sourlas, Graph bipartitioning and statistical mechanics , Journal of Physics A: Mathematical and General 20
1987
Earlier work this paper cites.
M. Mézard, G. Parisi, and M. A. Virasoro, Spin glass theory and beyond , World Scientific, 1987
1987
Earlier work this paper cites.
D Sherrington and KYM Wong, Graph bipartitioning and the bethe spin glass , Journal of Physics A: Mathematical and General 20
1987
Earlier work this paper cites.
R. Lyons, Random walks and percolation on trees , The Annals of Probability (1990), 931–958
1990
Earlier work this paper cites.
E. Brézin and S. R. Wadia, The large n expansion in quantum field theory and statistical physics: from spin systems to 2-dimensional gravity , World scientific, 1993
1993
Earlier work this paper cites.
B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giantk-core in a random graph , Journal of Combinatorial Theory, Series B 67
1996
Earlier work this paper cites.
R. Tibshirani, Regression shrinkage and selection with the Lasso , J. Royal. Statist. Soc B 58
1996
Earlier work this paper cites.
R. Lyons, R. Pemantle, and Y. Peres, Unsolved problems concerning random walks on trees , Classical and modern branching processes, Springer, 1997, pp. 223–237
1997
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit , SIAM journal on scientific computing 20
1998
Earlier work this paper cites.
A. Ben-Dor, R. Shamir, and Z. Yakhini, Clustering gene expression patterns , Journal of computational biology 6
1999
Earlier work this paper cites.
L. Wasserman, Bayesian model selection and model averaging , Journal of mathematical psychology 44
2000
Earlier work this paper cites.
B. Bollobás, C. Borgs, J. T. Chayes, J. H. Kim, and D. B. Wilson, The scaling window of the 2-sat transition , Random Structures & Algorithms 18
2001
Earlier work this paper cites.
M. Mézard and G. Parisi, The Bethe lattice spin glass revisited , The European Physical Journal B-Condensed Matter and Complex Systems 20
2001
Earlier work this paper cites.
M. Girvan and M. Newman, Community structure in social and biological networks , Proceedings of the national academy of sciences 99
2002
Earlier work this paper cites.
Francesco Guerra and Fabio Lucio Toninelli, The thermodynamic limit in mean field spin glass models , Communications in Mathematical Physics 230
2002
Earlier work this paper cites.
Samuel Burer and Renato DC Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , Mathematical Programming 95
2003
Earlier work this paper cites.
A Crisanti, T Rizzo, and T Temesvari, On the parisi-toulouse hypothesis for the spin glass phase in mean-field theory , The European Physical Journal B-Condensed Matter and Complex Systems 33
2003
Earlier work this paper cites.
D. J. Aldous and A. Bandyopadhyay, A survey of max-type recursive distributional equations , Annals of Applied Probability (2005), 1047–1110
2005
Cited alongside, same era.
S. Arora, E. Berger, E. Hazan, G. Kindler, and M. 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
Cited alongside, same era.
D. L. Donoho and J. Tanner, Neighborliness of randomly-projected simplices in high dimensions , Proceedings of the National Academy of Sciences 102
2005
Cited alongside, same era.
A. Braun and T. Aspelmeier, The m-component spin glass on a bethe lattice , Physical Review B 74
2006
Cited alongside, same era.
S. Khot, Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique , SIAM Journal on Computing 36
2006
F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborová, and P. Zhang, Spectral redemption in clustering sparse networks , Proceedings of the National Academy of Sciences 110
2013
Later among the works it cites.
R. Lyons and Y. Peres, Probability on trees and networks , Citeseer, 2013
2013
Later among the works it cites.
E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer, Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery , Network Science and Engineering, IEEE Transactions on 1
2014
Later among the works it cites.
Boris Alexeev, Afonso S Bandeira, Matthew Fickus, and Dustin G Mixon, Phase retrieval with polarization , SIAM Journal on Imaging Sciences 7
2014
Later among the works it cites.
D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp, Living on the edge: Phase transitions in convex programs with random data , Information and Inference (2014), iau005
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
E. Candés and T. Tao, The Dantzig selector: statistical estimation when p is much larger than n , Annals of Statistics 35
2007
Cited alongside, same era.
Ulrike Von Luxburg, A tutorial on spectral clustering , Statistics and computing 17
2007
Cited alongside, same era.
Reinhold Oppermann and Manuel J Schmidt, Universality class of replica symmetry breaking, scaling behavior, and the low-temperature fixed-point order function of the sherrington-kirkpatrick model , Physical Review E 78
2008
Cited alongside, same era.
M. Capitaine, C. Donati-Martin, and D. Féral, The largest eigenvalues of finite rank deformation of large wigner matrices: convergence and nonuniversality of the fluctuations , The Annals of Probability (2009), 1–47
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, Message Passing Algorithms for Compressed Sensing , Proceedings of the National Academy of Sciences 106
2009
Cited alongside, same era.
Y. Koren, R. Bell, and C. Volinsky, Matrix factorization techniques for recommender systems , Computer 42
2009
Cited alongside, same era.
M. Mézard and A. Montanari, Information, Physics and Computation , Oxford, 2009
2009
Cited alongside, same era.
2014
Later among the works it cites.
2014
Later among the works it cites.
D. P. Landau and K. Binder, A guide to monte carlo simulations in statistical physics , Cambridge university press, 2014
2014
Later among the works it cites.
L. Massoulié, Community detection thresholds and the weak ramanujan property , Proceedings of the 46th Annual ACM Symposium on Theory of Computing, ACM, 2014, pp. 694–703
2014
Later among the works it cites.
2014
Later among the works it cites.
A. Saade, F. Krzakala, and L. Zdeborová, Spectral clustering of graphs with the bethe hessian , Advances in Neural Information Processing Systems, 2014, pp. 406–414
2014
Later among the works it cites.
C. Bordenave, M. Lelarge, and L. Massoulié, Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs , Foundations of Computer Science (FOCS), 2015 IEEE 55th Annual Symposium on, 2015
2015
Closest in time.
E. J Candes, Y. C. Eldar, T. Strohmer, and V. Voroninski, Phase retrieval via matrix completion , SIAM Review 57
2015
Closest in time.
M. Cucuringu, Synchronization over 𝕫 2 {\mathbb{z}}_{2} and community detection in signed multiplex networks with constraints , Journal of Complex Networks (2015), cnu050
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
A. Dembo and A. Montanari, Finite size scaling for the core of large random hypergraphs , The Annals of Applied Probability 18
2040
Closest in time.
E. J. Candès and T. Tao, The power of convex relaxation: Near-optimal matrix completion , Information Theory, IEEE Transactions on 56
2080
Closest in time.