The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The Littlewood–Offord problem and invertibility of random matrices
Open accessAbstract
We prove two basic conjectures on the distribution of the smallest singular value of random n × n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n − 1 / 2 , which is optimal for Gaussian matrices. Moreover, we give a optimal estimate on the tail probability. This comes as a consequence of a new and essentially sharp estimate in the Littlewood–Offord problem: for i.i.d. random variables X k and real numbers a k , determine the probability p that the sum ∑ k a k X k lies near some number v . For arbitrary coefficients a k of the same order of magnitude, we show that they essentially lie in an arithmetic progression of length 1 / p .
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Loève, M. (1963) · Andalas University Repository (Andalas University) · Cited by 5,938
Proceedings of the International Congress of Mathematicians: August 3–11, 1994 Zürich, Switzerland
(1995) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9078-6 · Cited by 2,042
(1976) · Lecture Notes in Mathematics · doi:10.1007/bfb0082336 · Cited by 1,297
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
Handbook of geometry of Banach spaces
Johnson, W. B., & Lindenstrauss, J. (2001) · Cited by 510
Probability Theory, An Analytic View
Stroock, D. W. (2024) · Cambridge University Press eBooks · doi:10.1017/9781009549035 · Cited by 466
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
Gaussian processes: Inequalities, small ball probabilities and applications
Li, W. V., & Shao, Q.-M. (2001) · Handbook of Statistics · doi:10.1016/s0169-7161(01)19019-x · Cited by 388
On the limit of the largest eigenvalue of the large dimensional sample covariance matrix
Yin, Y. Q., Bai, Z. D., & Krishnaiah, P. R. (1988) · Probability Theory and Related Fields · doi:10.1007/bf00353874 · Cited by 341
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-38822-7 · Cited by 301
Soshnikov, A. (2002) · Journal of Statistical Physics · doi:10.1023/a:1019739414239 · Cited by 227
Inverse Littlewood–Offord theorems and the condition number of random discrete matrices
Tao, T., & Vu, V. (2009) · Annals of Mathematics · doi:10.4007/annals.2009.169.595 · Cited by 219
Some estimates of norms of random matrices
Latała, R. (2004) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-04-07800-1 · Cited by 214
Condition numbers of random matrices
Szarek, S. J. (1991) · Journal of Complexity · doi:10.1016/0885-064x(91)90002-f · Cited by 165
On the probability that a random ±1-matrix is singular
Kahn, J., Komlós, J., & Szemerédi, E. (1995) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1995-1260107-2 · Cited by 158
On random ±1 matrices: Singularity and determinant
Tao, T., & Vu, V. (2005) · Random Structures and Algorithms · doi:10.1002/rsa.20109 · Cited by 128
Stochastic Processes: Theory and Methods
Shanbhag, D. N., & Rao, C. R. (2001) · Cited by 97
On subspaces spanned by random selections of ±1 vectors
Odlyzko, A. M. (1988) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(88)90046-5 · Cited by 59
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
A Randomized Kaczmarz Algorithm with Exponential Convergence
Strohmer, T., & Vershynin, R. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9030-4 · Cited by 903
Self-citationRandom matrices: Universality of ESDs and the circular law
Tao, T., Vu, V., & Krishnapur, M. (2010) · The Annals of Probability · doi:10.1214/10-aop534 · Cited by 415
Non-asymptotic Theory of Random Matrices: Extreme Singular Values
Rudelson, M., & Vershynin, R. (2011) · Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) · doi:10.1142/9789814324359_0111 · Cited by 296
Self-citationHarmless interpolation of noisy data in regression
Muthukumar, V., Vodrahalli, K., & Sahai, A. (2019) · 2019 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849614 · Cited by 162
Metadata
- Authors
- Rudelson, M., & Vershynin, R.
- Venue
- Advances in Mathematics
- Publisher
- Elsevier BV
- Published
- 2008-06
- Volume
- 218
- Issue
- 2
- Pages
- 600-633
- ISSN
- 0001-8708 (ISSN-L)
- OpenAlex
- W2081131431
- Cited by
- 322
- References
- 23
- FWCI
- 16.14
- 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
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.