Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries

Abstract

Let A=(aij) be an n× n random matrix with i.i.d. entries such that E a11 = 0 and E a112 = 1. We prove that for any δ>0 there is L>0 depending only on δ, and a subset N of B2n of cardinality at most (δ n) such that with probability very close to one we have A(B2n)⊂ y∈ A(N)(y+LnB2n). As an application, we show that for some L'>0 and u∈[0,1) depending only on the distribution law of a11, the smallest singular value sn of the matrix A satisfies P\sn(A) n-1/2\ L'+un for all >0. The latter result generalizes a theorem of Rudelson and Vershynin which was proved for random matrices with subgaussian entries.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…