English
Related papers

Related papers: An upper bound on the smallest singular value of d…

200 papers

In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim…

Probability · Mathematics 2016-08-03 Feng Wei

We derive estimates for the largest and smallest singular values of sparse rectangular $N\times n$ random matrices, assuming $\lim_{N,n\to\infty}\frac nN=y\in(0,1)$. We consider a model with sparsity parameter $p_N$ such that $Np_N\sim…

Probability · Mathematics 2022-11-29 F. Götze , A. Tikhomirov

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i,j})_{i\leq j} $, independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(\sigma_{\min}(A) \leq \varepsilon/\sqrt{n}) \leq C…

Probability · Mathematics 2023-10-24 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

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 $\eta \geq 0$, $\Pr(s_n(M_n)…

Probability · Mathematics 2019-04-25 Vishesh Jain

We study the spectral norm of matrices M that can be factored as M=BA, where A is a random matrix with independent mean zero entries, and B is a fixed matrix. Under the (4+epsilon)-th moment assumption on the entries of A, we show that the…

Probability · Mathematics 2016-12-23 Roman Vershynin

Let $A$ be an $n\times n$ random matrix with independent, identically distributed mean 0, variance 1 subgaussian entries. We prove that $$ \mathbb{P}(A\text{ has distinct singular values})\geq 1-e^{-cn} $$ for some $c>0$, confirming a…

Probability · Mathematics 2025-03-04 Yi Han

We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances…

Probability · Mathematics 2012-12-21 Alexander Litvak , Omar Rivasplata

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Combinatorics · Mathematics 2011-03-18 Hoi H. Nguyen

Let $R_n$ be a $n \times n$ random matrix with i.i.d. subgaussian entries. Let $M$ be a $n \times n$ deterministic matrix with norm $\lVert M \rVert \le n^\gamma$ where $1/2<\gamma<1$. The goal of this paper is to give a general estimate of…

Probability · Mathematics 2021-08-13 Xiaoyu Dong

Let $M_n$ be an $n \times n$ random matrix with i.i.d. sparse discrete entries. In this paper, we develop a simple framework to solve the approximate Spielman-Teng theorem for $M_n$, which has the following form: There exist constants $C,…

Probability · Mathematics 2025-07-24 Kexin Yu

We show that for an $n\times n$ random symmetric matrix $A_n$, whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $\xi$ with mean $0$ and variance $1$, \[\mathbb{P}[s_n(A_n) \le…

Probability · Mathematics 2020-11-05 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $\delta>1$ and $\beta>0$ be some real numbers. We prove that there are positive $u,v,N_0$ depending only on $\beta$ and $\delta$ with the following property: for any $N,n$ such that $N\ge \max(N_0,\delta n)$, any $N\times n$ random…

Probability · Mathematics 2014-09-30 Konstantin E. Tikhomirov

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

Combinatorics · Mathematics 2021-04-22 Asaf Ferber , Matthew Kwan , Lisa Sauermann

We take a first small step to extend the validity of Rudelson-Vershynin type estimates to some sparse random matrices, here random permutation matrices. We give lower (and upper) bounds on the smallest singular value of a large random…

Probability · Mathematics 2014-04-16 Gérard Ben Arous , Kim Dang

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

Probability · Mathematics 2025-04-23 Yi Han

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…

Probability · Mathematics 2019-01-25 Ziliang Che , Patrick Lopatto

Let $x_i$, $i\in\mathbb{Z}$ be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz $\mathbf{X}=\left(x_{j-i}\right)_{1\leq i\leq p,1\leq j\leq n}$ and circulant $\mathbf{X}=\left(x_{(j-i)\mod…

Probability · Mathematics 2025-01-22 Alexei Onatski , Vladislav Kargin

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

Combinatorics · Mathematics 2019-09-13 Chunwei Song , Bowen Yao

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $\sigma_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment,…

Probability · Mathematics 2025-07-30 Yi Han