Finding a Large Submatrix of a Gaussian Random Matrix

Richard M Karp, The probabilistic analysis of some combinatorial search algorithms , Algorithms and complexity: New directions and recent results 1

1976

Earlier work this paper cites.

M. R. Leadbetter, G. Lindgren, and H. Rootzén, Extremes and related properties of random sequences and processes , Springer Series in Statistics, Springer-Verlag, New York, 1983

1983

Earlier work this paper cites.

Noga Alon, Michael Krivelevich, and Benny Sudakov, Finding a large hidden clique in a random graph , Random Structures and Algorithms 13

1998

Earlier work this paper cites.

Sara C Madeira and Arlindo L Oliveira, Biclustering algorithms for biological data analysis: a survey , IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 1

2004

Earlier work this paper cites.

Dimitris Achlioptas and Amin Coja-Oghlan, Algorithmic barriers from phase transitions , Foundations of Computer Science, 2008. FOCS’08. IEEE 49th Annual IEEE Symposium on, IEEE, 2008, pp. 793–802

2008

Earlier work this paper cites.

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 (2009), 985–1012

Original

2009

Cited alongside, same era.

Santo Fortunato, Community detection in graphs , Physics Reports 486

2010

Cited alongside, same era.

D. Achlioptas, A. Coja-Oghlan, and F. Ricci-Tersenghi, On the solution space geometry of random formulas , Random Structures and Algorithms 38

2011

Cited alongside, same era.

A. Coja-Oghlan and C. Efthymiou, On independent sets in random graphs , Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2011, pp. 136–144

2011

Cited alongside, same era.

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)

Quentin Berthet and Philippe Rigollet, Complexity theoretic lower bounds for sparse principal component detection , Conference on Learning Theory, 2013, pp. 1046–1066

2013

Later among the works it cites.

Xing Sun and Andrew B Nobel, On the maximal size of large-average and anova-fit submatrices in a gaussian random matrix , Bernoulli: official journal of the Bernoulli Society for Mathematical Statistics and Probability 19

2013

Later among the works it cites.

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

Later among the works it cites.

Mustazee Rahman and Balint Virag, Local algorithms for independent sets are half-optimal , arXiv preprint arXiv:1402.0485 (2014)

Original

2014

Later among the works it cites.