On the concentration of eigenvalues of random symmetric matrices
The DOI matches its Crossref record.
Abstract
It is shown that for every 1≤s≤n, the probability that thes-th largest eigenvalue of a random symmetricn-by-n matrix with independent random entries of absolute value at most 1 deviates from its median by more thant is at most 4e−t232s2. The main ingredient in the proof is Talagrand’s Inequality for concentration of measure in product spaces.
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
Spectral partitioning of random graphs
McSherry, F. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959929 · Cited by 584
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Rigidity of eigenvalues of generalized Wigner matrices
Erdős, L., Yau, H.-T., & Yin, J. (2012) · Advances in Mathematics · doi:10.1016/j.aim.2011.12.010 · Cited by 345
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
Fast computation of low-rank matrix approximations
Achlioptas, D., & Mcsherry, F. (2007) · Journal of the ACM · doi:10.1145/1219092.1219097 · Cited by 292
The Largest Eigenvalue of Sparse Random Graphs
KRIVELEVICH, M., & SUDAKOV, B. (2003) · Combinatorics, Probability and Computing · doi:10.1017/s0963548302005424 · Cited by 207
Self-citationExact and stable recovery of rotations for robust synchronization
Wang, L., & Singer, A. (2013) · Information and Inference · doi:10.1093/imaiai/iat005 · Cited by 178
Metadata
- Authors
- Alon, N., Krivelevich, M., & Vu, V. H.
- Venue
- Israel Journal of Mathematics
- Published
- 2002-12
- Volume
- 131
- Issue
- 1
- Pages
- 259-267
- ISSN
- 0021-2172 (ISSN-L)
- 1565-8511
- OpenAlex
- W2061109699
- Cited by
- 133
- References
- 0
- FWCI
- 6.84
- 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
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.