Answers are grounded in this paper and cite their sources.
Let A be an n×n random matrix with independent centered nonconstant subgaussian entries. We give the small ball probability for the kth smallest singular value of A when k∈(clogn,cn√). Furthermore, we prove that for any k<cn√, the probability of the matrix having a rank lower than n−k is sub-exponential. This extends the earlier results of Rudelson’s 2024 paper by removing the assumption of the identical distribution of the entries across the matrix. Our model covers inhomogeneous matrices, allowing different subgaussian moments for the entries as long as their subgaussian moments have a standard upper bound. In past work, the assumption of i.i.d. entries was required due to the lack of least common denominators of the non-i.i.d. random matrix. We overcome this problem using the randomized least common denominator (RLCD) of Livshyts (2021).
No takes yet. Share an insight, caveat, or question.
Dai et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: