Finding a large submatrix of a Gaussian random matrix
We consider the problem of finding a k × k submatrix of an n × n matrix with i.i.d. standard Gaussian entries, which has a large average entry. It was shown in [Bhamidi, Dey and Nobel (2012)] using nonconstructive methods that the largest average value of a k × k submatrix is 2(1 + o(1))√log n/k, wi...
Main Authors: | Gamarnik, David, Li, Quan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Published: |
Institute of Mathematical Statistics
2019
|
Online Access: | http://hdl.handle.net/1721.1/120593 https://orcid.org/0000-0001-8898-8778 https://orcid.org/0000-0002-3726-1517 |
Similar Items
-
The overlap gap property in principal submatrix recovery
by: Gamarnik, David
Published: (2021) -
The overlap gap property in principal submatrix recovery
by: Gamarnik, David
Published: (2021) -
The overlap gap property in principal submatrix recovery
by: Gamarnik, David, et al.
Published: (2022) -
The Determination Method of Satisfactory Consistency of the Interval Number Pairwise Comparisons Matrix Based on Submatrix
by: Fengxia Jin, et al.
Published: (2022-12-01) -
The Extraction of Maximal-Sum Principal Submatrix and Its Applications
by: Yizheng Zhang, et al.
Published: (2023-06-01)