Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Aug 2015 in math.PR | (1508.06690v3)

Abstract: Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}2 = 1$. We prove that for any $\delta>0$ there is $L>0$ depending only on $\delta$, and a subset $\mathcal{N}$ of $B_2n$ of cardinality at most $\exp(\delta n)$ such that with probability very close to one we have $$A(B_2n)\subset \bigcup_{y\in A(\mathcal{N})}\bigl(y+L\sqrt{n}B_2n\bigr).$$ As an application, we show that for some $L'>0$ and $u\in[0,1)$ depending only on the distribution law of $a_{11}$, the smallest singular value $s_n$ of the matrix $A$ satisfies $\mathbb{P}{s_n(A)\le \varepsilon n{-1/2}}\le L'\varepsilon+un$ for all $\varepsilon>0$. The latter result generalizes a theorem of Rudelson and Vershynin which was proved for random matrices with subgaussian entries.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.