Extremal random matrices with independent entries and matrix superconcentration inequalities

Tatiana Brailovskaya & Ramon Van Handel

Annals of Probability2026https://doi.org/10.1214/25-aop1776article
ABDC A*
Weight
0.50

Abstract

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 random matrix moments 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.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1214/25-aop1776

Or copy a formatted citation

@article{tatiana2026,
  title        = {{Extremal random matrices with independent entries and matrix superconcentration inequalities}},
  author       = {Tatiana Brailovskaya & Ramon Van Handel},
  journal      = {Annals of Probability},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1214/25-aop1776},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Extremal random matrices with independent entries and matrix superconcentration inequalities

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.