Author:
Bhamidi Shankar,Dey Partha S.,Nobel Andrew B.
Funder
Directorate for Mathematical and Physical Sciences
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Statistics and Probability,Analysis
Reference43 articles.
1. Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Ann. Math. (2) 162(3), 1335–1351 (2005)
2. Addario-Berry, L., Broutin, N., Devroye, L., Lugosi, G.: On combinatorial testing problems. Ann. Statist. 38(5), 3063–3092 (2010)
3. Aidekon, E.: Convergence in law of the minimum of a branching random walk (2011). arXiv preprint
arXiv:1101.1810
4. Aldous, D.J., Bordenave, C., Lelarge, M.: Dynamic programming optimization over random data: the scaling exponent for near-optimal solutions. SIAM J. Comput. 38(6), 2382–2410 (2009)
5. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), pp. 594–598 (1998)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Statistical and Computational Limits of Detecting and Recovering Hidden Submatrices;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14
2. Statistical mechanics of the maximum-average submatrix problem;Journal of Statistical Mechanics: Theory and Experiment;2024-01-01
3. Detection and Recovery of Hidden Submatrices;IEEE Transactions on Signal and Information Processing over Networks;2024
4. The overlap gap property in principal submatrix recovery;Probability Theory and Related Fields;2021-09-27