A large deviation inequality for the rank of a random matrix

Abstract

Let AA be an n×nn \times n random matrix with independent identically distributed non-constant subgaussian entries.Then for any kcnk \le c \sqrt{n}, rank(A)nk \text{rank}(A) \ge n-k with probability at least 1exp(ckn)1-\exp(-c'kn)

    Similar works

    Full text

    thumbnail-image

    Available Versions