On the spectral norm of Gaussian random matrices
arXiv:1502.05003 · doi:10.1090/tran/6922
Abstract
Let be a symmetric random matrix with independent but non-identically distributed Gaussian entries. It has been conjectured by Latał{a} that the spectral norm of is always of the same order as the largest Euclidean norm of its rows. A positive resolution of this conjecture would provide a sharp understanding of the probabilistic mechanisms that control the spectral norm of inhomogeneous Gaussian random matrices. This paper establishes the conjecture up to a dimensional factor of order . Moreover, dimension-free bounds are developed that are optimal to leading order and that establish the conjecture in special cases. The proofs of these results shed significant light on the geometry of the underlying Gaussian processes.
18 pages, 1 figure; final version, to appear in Trans. Amer. Math. Soc
References in corpus (2)
Cited by in corpus (14)
- The dimension-free structure of nonhomogeneous random matrices
- Structured Random Matrices
- Matrix Concentration Inequalities and Free Probability
- Random sections of ellipsoids and the power of random information
- Non-Asymptotic Analysis of Ensemble Kalman Updates: Effective Dimension and Localization
- Sparse random tensors: Concentration, regularization and applications
- Bootstrap confidence sets for spectral projectors of sample covariance
- Chaining, Interpolation, and Convexity II: The contraction principle
- Norms of Randomized Circulant Matrices
- Extreme singular values of inhomogeneous sparse random rectangular matrices
- Random sections of -ellipsoids, optimal recovery and Gelfand numbers of diagonal operators
- Covariance Operator Estimation via Adaptive Thresholding
- Large deviations for the largest eigenvalue of Gaussian networks with constant average degree
- Norms of structured random matrices