REVIEW 2 cited by
Higher order fluctuations of extremal eigenvalues of sparse random matrices
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
Signed reviews
abstract
We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs $\mathcal{G}(N,p)$. Recently, it was shown that the leading order fluctuations of extremal eigenvalues are given by a single random variable associated with the total degree of the graph (Ann. Probab., 48(2):916-962, 2020; Probab. Theory Related Fields, 180:985-1056, 2021). We construct a sequence of random correction terms to capture higher (sub-leading) order fluctuations of extremal eigenvalues in the regime $N^{\epsilon} < pN < N^{1/3-\epsilon}$. Using these random correction terms, we prove a local law up to a shifted edge and recover the rigidity of extremal eigenvalues under some corrections for $pN>N^{\epsilon}$.
Forward citations
Cited by 2 Pith papers
-
Quantitative Tracy-Widom laws for sparse random matrices
For sparse random matrices with q ≥ N^{1/6+δ}, the largest eigenvalue, after a small model-dependent correction, converges to Tracy-Widom at rate almost N^{-1/3} + N^{2/3}/q^4.
-
Matrix Completion via Residual Spectral Matching
A residual spectral matching estimator for noisy matrix completion matches the singular values of residuals to those of sparse random matrices and claims minimax optimal error rates.
Discussion (0). Continue with ORCID to comment.