REVIEW 3 cited by
Edge universality of sparse Erd\H{o}s-R\'enyi digraphs
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
Let $\mathcal A$ be the adjacency matrix of the Erd\H{o}s-R\'{e}nyi directed graph $\mathscr G(N,p)$. We denote the eigenvalues of $\mathcal A$ by $\lambda_1^{\cal A},...,\lambda^{\cal A}_N$, and $|\lambda_1^{\cal A}|=\max_i|\lambda_i^{\cal A}|$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that \[ \max_{i=2,3,...,N} \bigg|\frac{\lambda_i^{\mathcal A}}{\sqrt{Np(1-p)}}\bigg| =1+O(N^{-1/2+o(1)}) \] with very high probability. In addition, we prove that near the unit circle, the local eigenvalue statistics of ${\mathcal A}/\sqrt{Np(1-p)}$ coincide with those of the real Ginibre ensemble. As a by-product, we also show that all non-trivial eigenvectors of $\mathcal A$ are completely delocalized. For Hermitian random matrices, it is known that the edge statistics are sensitive to the sparsity: in the very sparse regime, one needs to remove many noise random variables (which affect both the mean and the fluctuation) to recover the Tracy-Widom distribution. Our results imply that, compared to their analogues in the Hermitian case, the edge statistics of non-Hermitian sparse random matrices are more robust.
Forward citations
Cited by 3 Pith papers
-
Bulk Universality for Sparse Complex non-Hermitian Random Matrices
Bulk local eigenvalue statistics of sparse complex non-Hermitian random matrices are universal and match the complex Ginibre ensemble.
-
Spectral radius concentration for inhomogeneous random matrices with independent entries
For inhomogeneous random matrices, the spectral radius is bounded by the variance row/column sums up to the optimal sparsity (log n)^{-1/2}.
-
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.