A large deviation inequality for the rank of a random matrix
Abstract
Let A be an n × n random matrix with independent identically distributed non-constant subgaussian entries. Then for any k c n, \[ rank(A) n-k \] with probability at least 1-(-c'kn).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.