

























Let $σ_n(\cdot)$ denote the least singular value of a $n \times n$ matrix. It is well-known that $\mathbb{P}[σ_n(A) \le \varepsilon] \le \varepsilon n$ if $A$ is drawn from the real Ginibre ensemble of $n \times n$ matrices and $\mathbb{P}[σ_n(A) \le \varepsilon] \le \varepsilon^2 n^2$ if $A$ is drawn from the complex Ginibre ensemble. In this paper, we will show a similar phenomenon occurs for sparse random matrices.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。