首页/论文/2004.06757

arXiv 2004.067572020-04-14math.PR

Least singular value and condition number of a square random matrix with i.i.d. rows

Matteo Gregoratti, Davide Maran

英文摘要：

We consider a square random matrix made by i.i.d. rows with any distribution and prove that, for any given dimension, the probability for the least singular value to be in [0; $ε$) is at least of order $ε$. This allows us to generalize a result about the expectation of the condition number that was proved in the case of centered gaussian i.i.d. entries: such an expectation is always infinite. Moreover, we get some additional results for some well-known random matrix ensembles, in particular for the isotropic log-concave case, which is proved to have the best behaving in terms of the well conditioning.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

离散随机矩阵的尖锐奇异性渐近

Sharp singularity asymptotics for discrete random matrices

Shandong University（山东大学）

该研究解决了Rademacher奇异性猜想，证明了离散随机矩阵奇异概率的尖锐上界，并推广到一般离散分布，方法结合随机性反转与傅里叶平均。

2026-10-19math.PR

样本协方差阵的特征多项式：非方情形

Characteristic Polynomials of Sample Covariance Matrices: The Non-Square Case

本文研究了具有独立同分布的大数据矩阵的样本协方差阵。复数矩阵项，并且在行数和列数之间的差趋于无穷大的意义上是非正方形的。我们表明，二阶相关函数的特征多项式的样本协方差阵是渐近给出的正弦核在大部分的频谱和艾里核在边缘的频谱。对于实样本协方差阵也给出了类似的结果。

2009-12-15math.PR

Long Random Matrices and Tensor Unfolding

California Institute of Technology（加州理工学院）；Courant Institute, NYU（纽约大学库朗研究所）

In this paper, we consider the singular values and singular vectors of low rank perturbations of large rectangular random matrices, in the regime the matrix is "long": we allow the number of rows (columns) to grow polynomially in the number of columns (rows). We prove there exists a critical signal-to-noise ratio (depending on the dimensions of the matrix), and the extreme singular values and singular vectors exhibit a BBP type phase transition. As a main application, we investigate the tensor unfolding algorithm for the asymmetric rank-one spiked tensor model, and obtain an exact threshold, w…

2021-10-19cs.LGmath.PRstat.ML

Singular values of large non-central random matrices

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It provides a decomposition of the largest $K$ singular values into the deterministic rate of growth, random centered fluctuations given as explicit linear combinations of the entries of the matrix, and a term negligible in probability. We use this representation to establish asymptotic normality of the largest singular values for random matrices with means that ha…

2019-09-01math.PR

An upper bound on the smallest singular value of a square random matrix

Let $A = (a_{ij})$ be a square $n\times n$ matrix with i.i.d. zero mean and unit variance entries. Rudelson and Vershynin showed that the upper bound for a smallest singular value $s_n(A)$ is of order $n^{-\frac12}$ with probability close to one under additional assumption on entries of $A$ that $\mathbb{E}a^4_{11} < \infty$. We remove the assumption on the fourth moment and show the upper bound assuming only $\mathbb{E}a^2_{11} = 1.$

2018-11-20math.PR

Singularity of discrete random matrices

Let $ξ$ be a non-constant real-valued random variable with finite support, and let $M_{n}(ξ)$ denote an $n\times n$ random matrix with entries that are independent copies of $ξ$. For $ξ$ which is not uniform on its support, we show that \begin{align*} \mathbb{P}[M_{n}(ξ)\text{ is singular}] &= \mathbb{P}[\text{zero row or column}] + (1+o_n(1))\mathbb{P}[\text{two equal (up to sign) rows or columns}], \end{align*} thereby confirming a folklore conjecture. As special cases, we obtain: (1) For $ξ= \text{Bernoulli}(p)$ with fixed $p \in (0,1/2)$, \[\mathbb{P}[M_{n}(ξ)\text{ is singular}] = 2n(1-p)…

2021-05-05math.COmath.PR

更多相关论文收起更多论文

多元变量误差模型$AX=B$中总体最小二乘估计的渐近正态性

Asymptotic normality of total least squares estimator in a multivariate errors-in-variables model $AX=B$

考虑了一个多元函数测量误差模型$AX\approx B$ . $[A,B]$中的误差是不相关的、逐行独立的，并且具有相等（未知）方差。研究了$X$的全最小二乘估计，在正态误差下，它与极大似然估计一致。当$A$中的行数增加时，我们给出了估计量渐近正态性的条件。在适当的假设下，极限高斯随机矩阵的协方差结构是非奇异的。对于正态误差，所得结果可用于构造$X$的线性泛函的渐近置信区间。

2016-07-13math.PR

Hadamard矩阵导引

Invitation to Hadamard matrices

本文介绍了实与复Hadamard矩阵的基础理论，将其视为广义Fourier矩阵，并重点探讨了复矩阵的几何与分析性质。

2024-07-29math.COmath.PR

无浓度随机矩阵最小奇异值的界

Bounding the smallest singular value of a random matrix without concentration

给定$X$为${\mathbb{R}}^n$中的随机向量，将$X_1,...,X_N$设置为$X$的独立副本，并将$Γ=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$设为行为$\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$的矩阵。我们得到了尖锐的概率下界的最小奇异值$λ_{\min}(Γ)$在一个相当一般的情况下，特别是，假设$X$是一个各向同性的随机向量，其中$\sup_{t\in S^{n-1}}{\mathbb{E}}|<t,X>|^{2+η} \leq L$的一些$L,η>0$。我们的结果意味着一个白阴型的下限保持$η>2$，并在一个对数因子，$η=2$以及。在不对欧几里德范数$\|X\|_{\ell_2^n}$作任何额外假设的情况下，该界限成立。此外，我们建立了一个非平凡的下界，即使没有任何更高的时刻的假设（对应的情况$η=0$），如果线性形式满足一个弱的“小球”属性。

2013-12-12math.PR

极端纵横比下的尖峰奇异值与奇异向量

Spiked Singular Values and Vectors under Extreme Aspect Ratios

本文研究了非比例体制下含噪低秩矩阵的尖峰奇异值与向量行为，发现在矩阵尺寸极端纵横比变化的新型测量尺度下，经验奇异值与向量的位移及相变依然存在，且较长维度的顶部奇异向量与无噪声信号渐近不相关。

2023-07-30math.PRmath.STstat.TH

The smallest singular value of random combinatorial matrices

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le \frac{\varepsilon}{\sqrt{n}}\Big\} \le C\varepsilon + 2 e^{-cn} \quad \forall \varepsilon \ge 0, \] which is optimal up to the constants $C,c>0$. This improves on earlier results of Ferber, Jain, Luh and Samotij, as well as Jain. In particular, for $\varepsilon=0$, we obtain the first exponential bound in dimension for the singularity probability \[ \mathbb{P}…

2020-10-30math.COmath.PR

The smallest singular value of inhomogeneous square random matrices

We show that for an $n\times n$ random matrix $A$ with independent uniformly anti-concentrated entries, such that $\mathbb{E} ||A||^2_{HS}\leq K n^2$, the smallest singular value $σ_n(A)$ of $A$ satisfies $$ P\left( σ_n(A)\leq \frac{\varepsilon}{\sqrt{n}} \right) \leq C\varepsilon+2e^{-cn},\quad \varepsilon \ge 0. $$ This extends earlier results of Rudelson and Vershynin, and Rebrova and Tikhomirov by removing the assumption of mean zero and identical distribution of the entries across the matrix, as well as the recent result of Livshyts, where the matrix was required to have i.i.d. rows. Our …

2020-10-27math.CAmath.MGmath.PR

Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices

An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $η\geq 0$, $\Pr(s_n(M_n) \leq η) \lesssim n^{C}η+ \exp(-n^{c})$. The goal of this paper is to develop a simple and novel framework for proving such results for discrete random matrices. As an application, we prove an approximate Spielman-Teng theorem for $\{0,1\}$-valued matrices, each of whose rows is an independent vector with exactly $n/2$ zero components. This improves on previous work…

2019-04-24math.COmath.PR

随机方阵的最小奇异值是O（n^{-1/2}）

The least singular value of a random square matrix is O(n^{-1/2})

设A是一个矩阵，其元素是实同分布的。具有单位方差和适当矩假设的中心随机变量。则A的最小奇异值以高概率为n^{-1/2}阶。作者最近证明了这类估计的下估计，本文建立了匹配上估计。

2008-05-22math.FAmath.PR

有符号随机组合矩阵的最小奇异值

The smallest singular value of signed random combinatorial matrices

Shandong University（山东大学）

研究了有符号随机组合矩阵的最小奇异值，证明了其在特定条件下概率分布，并展示了该方法在受限环境下的应用。

2026-04-13math.COmath.PR

The smallest singular value of a shifted $d$-regular random square matrix

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set of all $0/1$-valued square $n\times n$ matrices such that each row and each column of a matrix $M\in \mathcal{M}_{n,d}$ has exactly $d$ ones. Let $M$ be uniformly distributed on $\mathcal{M}_{n,d}$. Then the smallest singular value $s_{n} (M)$ of $M$ is greater than $c_2 n^{-6}$ with probability at least $1-C_2\log^2 d/\sqrt{d}$, where $c_1$, $c_2$, $C_1$, a…

2018-07-18math.COmath.PR