Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 322

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 access
Rudelson, Mark, Vershynin, Roman·2008·Advances in Mathematics

Abstract

Abstract 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.aim.2008.01.010

Cites

23 of 23 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 23 references

Cited by

See all 322

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

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 Littlewood–Offord problem and invertibility of random matrices. https://app.cochat.ai/papers/10.1016/j.aim.2008.01.010
The paper
Rudelson, M., & Vershynin, R. (2008). The Littlewood–Offord problem and invertibility of random matrices. Advances in Mathematics. https://doi.org/10.1016/j.aim.2008.01.010

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.