The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Open accessAbstract
We consider the eigenvalues and eigenvectors of finite, low rank perturbations of random matrices. Specifically, we prove almost sure convergence of the extreme eigenvalues and appropriate projections of the corresponding eigenvectors of the perturbed matrix for additive and multiplicative perturbation models. The limiting non-random value is shown to depend explicitly on the limiting eigenvalue distribution of the unperturbed random matrix and the assumed perturbation model via integral transforms that correspond to very well known objects in free probability theory that linearize non-commutative free additive and multiplicative convolution. Furthermore, we uncover a phase transition phenomenon whereby the large matrix limit of the extreme eigenvalues of the perturbed matrix differs from that of the original matrix if and only if the eigenvalues of the perturbing matrix are above a certain critical threshold. Square root decay of the eigenvalue density at the edge is sufficient to ensure that this threshold is finite. This critical threshold is intimately related to the same aforementioned integral transforms and our proof techniques bring this connection and the origin of the phase transition into focus. Consequently, our results extend the class of `spiked' random matrix models about which such predictions (called the BBP phase transition) can be made well beyond the Wigner, Wishart and Jacobi random ensembles found in the literature. We examine the impact of this eigenvalue phase transition on the associated eigenvectors and observe an analogous phase transition in the eigenvectors. Various extensions of our results to the problem of non-extreme eigenvalues are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
Spectral Analysis of Large Dimensional Random Matrices
Bai, Z., & Silverstein, J. W. (2010) · Springer Series in Statistics · doi:10.1007/978-1-4419-0661-8 · Cited by 1,544
On the Distribution of the Roots of Certain Symmetric Matrices
Wigner, E. P. (1958) · The Annals of Mathematics · doi:10.2307/1970008 · Cited by 1,463
Bogaevski, V. N., & Povzner, A. (1991) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4438-7_1 · Cited by 1,384
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
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
Baik, J., Ben Arous, G., & Péché, S. (2005) · The Annals of Probability · doi:10.1214/009117905000000233 · Cited by 967
Deift, P. A., Kriecherbauer, T., McLaughlin, K. T.-R., Venakides, S., & Zhou, X. (1999) · Communications on Pure and Applied Mathematics · Cited by 776
Eigenvalues of large sample covariance matrices of spiked population models
Baik, J., & Silverstein, J. W. (2006) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2005.08.003 · Cited by 701
Cited by
SC3: consensus clustering of single-cell RNA-seq data
Kiselev, V. Y., Kirschner, K., Schaub, M. T., Andrews, T., Yiu, A., Chandra, T., Natarajan, K. N., Reik, W., Barahona, M., Green, A. R., et al. (2017) · Nature Methods · doi:10.1038/nmeth.4236 · Cited by 1,500
Biwhitening Reveals the Rank of a Count Matrix
Landa, B., Zhang, T. T. C. K., & Kluger, Y. (2022) · SIAM Journal on Mathematics of Data Science · doi:10.1137/21m1456807 · Cited by 20
The Limits of Query Monitoring against Distributed Model Extraction
Khilar, S. C. (2026) · arXiv
“In the cross-account matrix this is a rank-one spike of strength ℓ = ¯ S − 1, producing an outlier at (1 + ℓ )(1 + γ/ℓ ) when | ℓ | > √ γ , with γ = A/m (Baik et al., 2005; Benaych-Georges & Nadakuditi, 2011).”
Metadata
- Authors
- Benaych-Georges, F., & Nadakuditi, R. R.
- Venue
- Advances in Mathematics
- Publisher
- Elsevier BV
- Published
- 2011-05
- Volume
- 227
- Issue
- 1
- Pages
- 494-521
- ISSN
- 0001-8708 (ISSN-L)
- OpenAlex
- W2099551908
- Cited by
- 441
- References
- 24
- FWCI
- 21.70
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices. https://app.cochat.ai/papers/10.1016/j.aim.2011.02.007
- The paper
- Benaych-Georges, F., & Nadakuditi, R. R. (2011). The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices. Advances in Mathematics. https://doi.org/10.1016/j.aim.2011.02.007
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.