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) ) n/k, with high probability (w. h. p. ), when k=O (n/ n). In the same paper, evidence was provided that a natural greedy algorithm called the Largest Average Submatrix (LAS) for a constant k should produce a matrix with average entry at most (1+o (1) ) 2 n/k, namely approximately 2 smaller than the global optimum, though no formal proof of this fact was provided. In this paper, we show that the average entry of the matrix produced by the LAS algorithm is indeed (1+o (1) ) 2 n/k w. h. p. when k is constant and n grows. Then, by drawing an analogy with the problem of finding cliques in random graphs, we propose a simple greedy algorithm which produces a k k matrix with asymptotically the same average value (1+o (1) ) 2 n/k w. h. p. , for k=o (n). Since the greedy algorithm is the best known algorithm for finding cliques in random graphs, it is tempting to believe that beating the factor 2 performance gap suffered by both algorithms might be very challenging. Surprisingly, we construct a very simple algorithm which produces a k k matrix with average value (1+o₊ (1) +o (1) ) (4/3) 2 n/k for k=o ( (n) ^1. 5), that is, with the asymptotic factor 4/3 when k grows. To get an insight into the algorithmic hardness of this problem, and motivated by methods originating in the theory of spin glasses, we conduct the so-called expected overlap analysis of matrices with average value asymptotically (1+o (1) ) 2 n/k for a fixed value 1, 2. The overlap corresponds to the number of common rows and the number of common columns for pairs of matrices achieving this value (see the paper for details). We discover numerically an intriguing phase transition at ^*52/ (33) 1. 36084/3, 2: when ^*, appropriately defined. We conjecture that the OGP observed for >^* also marks the onset of the algorithmic hardness—no polynomial time algorithm exists for finding matrices with average value at least (1+o (1) ) 2 n/k, when >^* and k is a mildly growing function of n.