On the Smallest Singular Value of Log-Concave Random Matrices
Abstract
Let A be an N× n random matrix whose entries are coordinates of an isotropic log-concave random vector in RNn. We prove sharp lower tail estimates for the smallest singular value of A in the following cases: (1) when N=n and A is drawn from an unconditional distribution, with no independence assumption; (2) when the columns of A are independent and N≥ n; (3) when A is sufficiently tall, that is N≥ (1+λ)n for any positive constant λ.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.