Sparse random matrices: spectral edge and statistics of rooted trees
The DOI matches its Crossref record.
Abstract
Following Füredi and Komlós, we develop a graph theory method to study the high moments of large random matrices with independent entries. We apply this method to sparse N × N random matrices AN,p that have, on average, p non-zero elements per row. One of our results is related to the asymptotic behaviour of the spectral norm ∥AN,p∥ in the limit 1 ≪ p ≪ N. We show that the value pc = log N is the critical one for lim ∥AN,p/√p∥ to be bounded or not. We discuss relations of this result with the Erdős–Rényi limit theorem and properties of large random graphs. In the proof, the principal issue is that the averaged vertex degree of plane rooted trees of k edges remains bounded even when k → ∞. This observation implies fairly precise estimates for the moments of AN,p. They lead to certain generalizations of the results by Sinai and Soshnikov on the universality of local spectral statistics at the border of the limiting spectra of large random matrices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
An Introduction to Random Matrices
Anderson, G. W., Guionnet, A., & Zeitouni, O. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511801334 · Cited by 1,281
Angular synchronization by eigenvectors and semidefinite programming
Singer, A. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.001 · Cited by 329
The Largest Eigenvalue of Sparse Random Graphs
KRIVELEVICH, M., & SUDAKOV, B. (2003) · Combinatorics, Probability and Computing · doi:10.1017/s0963548302005424 · Cited by 207
“ntry of a matrix from the so-called Wigner ensemble by zero independently with probability q = 1−p. As such, it unifies the notions of the Wigner random matrices and random graphs. Khorunzhy proved in [8] that the spectral norm of the dilute random matrix is asymptotically equal to 2 √ np in the case p(n) ≫ logn/n (und…”
BackgroundLocal law and Tracy–Widom limit for sparse random matrices
Lee, J. O., & Schnelli, K. (2018) · Probability Theory and Related Fields · doi:10.1007/s00440-017-0787-8 · Cited by 87
Metadata
- Authors
- Khorunzhy, A.
- Venue
- Advances in Applied Probability
- Publisher
- Cambridge University Press (CUP)
- Published
- 2001-03
- Volume
- 33
- Issue
- 1
- Pages
- 124-140
- ISSN
- 0001-8678 (ISSN-L)
- 1475-6064
- OpenAlex
- W2090589820
- Cited by
- 38
- References
- 0
- FWCI
- 3.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparse random matrices: spectral edge and statistics of rooted trees. https://app.cochat.ai/papers/10.1017/s0001867800010661
- The paper
- Khorunzhy, A. (2001). Sparse random matrices: spectral edge and statistics of rooted trees. Advances in Applied Probability. https://doi.org/10.1017/s0001867800010661
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.