Pith. sign in

REVIEW 2 cited by

Universality and sharp matrix concentration inequalities

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.05142 v3 pith:VAFUZEVV submitted 2022-01-13 math.PR math.FAmath.OA

classification math.PRmath.FAmath.OA
keywords matrixrandomtheoryconcentrationinequalitiesmatricescovarianceentries
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields sharp matrix concentration inequalities for general sums of independent random matrices when combined with the Gaussian theory of Bandeira, Boedihardjo, and Van Handel. A key feature of the resulting theory is that it is applicable to a broad class of random matrix models that may have highly nonhomogeneous and dependent entries, which can be far outside the mean-field situation considered in classical random matrix theory. We illustrate the theory in applications to random graphs, matrix concentration inequalities for smallest singular values, sample covariance matrices, strong asymptotic freeness, and phase transitions in spiked models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood

    quant-ph 2025-05 conditional novelty 8.0 of 10

    A quantum extension of the low-degree method shows that state designs imply computational hardness for many single-copy quantum measurement strategies, yielding new information-computation gaps.

  2. Spectral Concentration and Recovery in Sparse High-Dimensional Random Geometric Graphs

    stat.ML 2026-07 accept novelty 7.0 of 10

    Sparse geometric graph adjacency spectra concentrate at the connectivity scale, yielding improved latent-vector recovery and the first connectivity-scale exact label recovery in the Gaussian mixture block model.

Pith tools