

























We prove nonasymptotic matrix concentration inequalities for the spectral norm of (sub)gaussian random matrices with centered independent entries that capture fluctuations at the Tracy-Widom scale. This considerably improves previous bounds in this setting due to Bandeira and Van Handel, and establishes the best possible tail behavior for random matrices with an arbitrary variance pattern. These bounds arise from an extremum problem for nonhomogeneous random matrices: among all variance patterns with a given sparsity parameter, the moments of the random matrix are maximized by block-diagonal matrices with i.i.d. entries in each block. As part of the proof, we obtain sharp bounds on large moments of Gaussian Wishart matrices.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。