arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.3886math.PR
收藏

重尾随机矩阵的通有链与最小奇异值

On generic chaining and the smallest singular value of random matrices with heavy tails

Shahar Mendelson, Grigoris Paouris

摘要:

我们提出了一个非常一般的链接方法,它允许一个控制的经验过程$\sup_{h \in H} |N^{-1}\sum_{i=1}^N h^2(X_i)-\E h^2|$的上确界在相当一般的情况下。我们使用这种方法建立两个主要结果。首先,一个定量(非渐近)版本的经典白音定理的奇异值的随机矩阵的i.i.d的项目,有沉重的尾巴,第二,尖锐的估计二次经验过程时,$H=\{\inr{t,\cdot} : t \in T\}$,$T \subset \R^n$和$μ$是一个各向同性的,无条件的,对数凹措施。

英文摘要:

We present a very general chaining method which allows one to control the supremum of the empirical process $\sup_{h \in H} |N^{-1}\sum_{i=1}^N h^2(X_i)-\E h^2|$ in rather general situations. We use this method to establish two main results. First, a quantitative (non asymptotic) version of the classical Bai-Yin Theorem on the singular values of a random matrix with i.i.d entries that have heavy tails, and second, a sharp estimate on the quadratic empirical process when $H=\{\inr{t,\cdot} : t \in T\}$, $T \subset \R^n$ and $μ$ is an isotropic, unconditional, log-concave measure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑