Finding Hidden Cliques of Size √N/e in Nearly Linear Time

Foundations of Computational Mathematics

Volumn 15, Issue 4, 2015, Pages 1069-1128

  Deshpande, Yash ^a   Montanari, Andrea ^b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Approximate message passing; Average case complexity; Belief propagation; Local algorithms; Random graphs; Sparse recovery

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; MESSAGE PASSING; SPECTROSCOPY;

AVERAGE-CASE COMPLEXITY; BELIEF PROPAGATION; LOCAL ALGORITHM; RANDOM GRAPHS; SPARSE RECOVERY;

GRAPH THEORY;

EID: 84938847112     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-014-9215-y     Document Type: Article

References (41)

1. Louigi Addario-Berry, Nicolas Broutin, Luc Devroye, and Gábor Lugosi. On combinatorial testing problems. The Annals of Statistics, 38(5):3063–3092, 2010.
2. Noga Alon, Michael Krivelevich, and Benny Sudakov. Finding a large hidden clique in a random graph. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 594–598. Society for Industrial and Applied Mathematics, 1998.
3. Noga Alon, Michael Krivelevich, and Van H Vu. On the concentration of eigenvalues of random symmetric matrices. Israel Journal of Mathematics, 131(1):259–267, 2002.
4. Brendan PW Ames and Stephen A Vavasis. Nuclear norm minimization for the planted clique and biclique problems. Mathematical programming, 129(1):69–89, 2011.
5. Dana Angluin. Local and global properties in networks of processors. In Proceedings of the twelfth annual ACM symposium on Theory of computing, pages 82–93. ACM, 1980.
6. Ery Arias-Castro, Emmanuel J Candès, and Arnaud Durand. Detection of an anomalous cluster in a network. The Annals of Statistics, 39(1):278–304, 2011.
7. Ery Arias-Castro, David L Donoho, and Xiaoming Huo. Near-optimal detection of geometric objects by fast multiscale methods. Information Theory, IEEE Transactions on, 51(7):2402–2425, 2005.
8. M. Bayati and A. Montanari. The dynamics of message passing on dense graphs, with applications to compressed sensing. IEEE Trans. on Inform. Theory, 57:764–785, 2011.
9. Mohsen Bayati, Marc Lelarge, and Andrea Montanari. Universality in polytope phase transitions and message passing algorithms. arXiv preprint arXiv:1207.7321, 2012.
10. Quentin Berthet and Philippe Rigollet. Computational lower bounds for sparse pca. arXiv preprint arXiv:1304.0828, 2013.
11. Shankar Bhamidi, Partha S Dey, and Andrew B Nobel. Energy landscape for large average submatrix detection problems in gaussian random matrices. arXiv preprint arXiv:1211.2284, 2012.
12. Patrick Billingsley. Probability and measure. John Wiley & Sons, 2008.
13. Emmanuel J Candès, Xiaodong Li, Yi Ma, and John Wright. Robust principal component analysis? Journal of the ACM (JACM), 58(3):11, 2011.
14. Alexandre d’Aspremont, Francis Bach, and Laurent El Ghaoui. Optimal solutions for sparse principal component analysis. The Journal of Machine Learning Research, 9:1269–1294, 2008.
15. Alexandre d’Aspremont, Laurent El Ghaoui, Michael I Jordan, and Gert RG Lanckriet. A direct formulation for sparse pca using semidefinite programming. SIAM review, 49(3):434–448, 2007.
16. Chandler Davis and W. M. Kahan. The rotation of eigenvectors by a perturbation. iii. SIAM Journal on Numerical Analysis, 7(1):pp. 1–46, 1970.
17. Yael Dekel, Ori Gurel-Gurevich, and Yuval Peres. Finding hidden cliques in linear time with high probability. In ANALCO, pages 67–75. SIAM, 2011.
18. Amir Dembo. Probability Theory. http://www.stanford.edu/~montanar/TEACHING/Stat310A/lnotes.pdf, 2013.
19. David L Donoho, Arian Maleki, and Andrea Montanari. Message-passing algorithms for compressed sensing. Proceedings of the National Academy of Sciences, 106(45):18914–18919, 2009.
20. Uriel Feige and Dorit Ron. Finding hidden cliques in linear time. DMTCS Proceedings, (01):189–204, 2010.
21. Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, and Ying Xiao. Statistical algorithms and a lower bound for planted clique. arXiv preprint arXiv:1201.1214, 2012.
22. Zoltán Füredi and János Komlós. The eigenvalues of random symmetric matrices. Combinatorica, 1(3):233–241, 1981.
23. Geoffrey R Grimmett and Colin JH McDiarmid. On colouring random graphs. In Mathematical Proceedings of the Cambridge Philosophical Society, volume 77, pages 313–324. Cambridge Univ Press, 1975.
24. Dongning Guo and Chih-Chun Wang. Asymptotic mean-square optimality of belief propagation for sparse linear systems. In Information Theory Workshop, 2006. ITW’06 Chengdu. IEEE, pages 194–198. IEEE, 2006.
25. Mark Jerrum. Large cliques elude the metropolis process. Random Structures & Algorithms, 3(4):347–359, 1992.
26. Iain M Johnstone and Arthur Yu Lu. On consistency and sparsity for principal components analysis in high dimensions. Journal of the American Statistical Association, 104(486), 2009.
27. Antti Knowles and Jun Yin. The isotropic semicircle law and deformation of wigner matrices. arXiv preprint arXiv:1110.6449, 2011.
28. Daphne Koller and Nir Friedman. Probabilistic graphical models: principles and techniques. MIT press, 2009.
29. Nathan Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193–201, 1992.
30. Marc Mezard and Andrea Montanari. Information, physics, and computation. Oxford University Press, 2009.
31. Andrea Montanari. Graphical Models Concepts in Compressed Sensing. In Y.C. Eldar and G. Kutyniok, editors, Compressed Sensing: Theory and Applications. Cambridge University Press, 2012.
32. Andrea Montanari and David Tse. Analysis of belief propagation for non-linear problems: The example of cdma (or: How to prove tanaka’s formula). In Information Theory Workshop, 2006. ITW’06 Punta del Este. IEEE, pages 160–164. IEEE, 2006.
33. Moni Naor and Larry Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259–1277, 1995.
34. Sundeep Rangan and Alyson K Fletcher. Iterative estimation of constrained rank-one matrices in noise. In Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, pages 1246–1250. IEEE, 2012.
35. Tom Richardson and Rüdiger Leo Urbanke. Modern coding theory. Cambridge University Press, 2008.
36. Andrey A Shabalin, Victor J Weigman, Charles M Perou, and Andrew B Nobel. Finding large average submatrices in high dimensional data. The Annals of Applied Statistics, pages 985–1012, 2009.
37. Xing Sun and Andrew B Nobel. On the size and recovery of submatrices of ones in a random binary matrix. J. Mach. Learn. Res, 9:2431–2453, 2008.
38. Jukka Suomela. Survey of local algorithms. ACM Computing Surveys (CSUR), 45(2):24, 2013.
39. Roman Vershynin. Introduction to the non-asymptotic analysis of random matrices. In Y.C. Eldar and G. Kutyniok, editors, Compressed Sensing: Theory and Applications, pages 210–268. Cambridge University Press, 2012.
40. Martin J Wainwright and Michael I Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1–2):1–305, 2008.
41. Hui Zou, Trevor Hastie, and Robert Tibshirani. Sparse principal component analysis. Journal of computational and graphical statistics, 15(2):265–286, 2006.