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...
相似书籍
-
The overlap gap property in principal submatrix recovery
由: Gamarnik, David
出版: (2021) -
The overlap gap property in principal submatrix recovery
由: Gamarnik, David
出版: (2021) -
The overlap gap property in principal submatrix recovery
由: Gamarnik, David, et al.
出版: (2022) -
A Solution Matrix by IEVP under the Central Principle Submatrix Constraints
由: Vineet Bhatt, et al.
出版: (2024-01-01) -
An Iterative Method for the Least-Squares Problems of a General Matrix Equation Subjects to Submatrix Constraints
由: Li-fang Dai, et al.
出版: (2013-01-01)