English
Related papers

Related papers: The Smallest Singular Value of a Shifted Random Ma…

200 papers

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…

Probability · Mathematics 2020-11-02 Tuan Tran

Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that \[\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n^{-1/2} \big) =…

Probability · Mathematics 2025-01-09 Ashwin Sah , Julian Sahasrabudhe , Mehtaab Sawhney

For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.

Probability · Mathematics 2019-08-27 Konstantin Tikhomirov

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 $\sigma_n(A)$ of $A$ satisfies $$ P\left( \sigma_n(A)\leq…

Probability · Mathematics 2020-10-29 Galyna V. Livshyts , Konstantin Tikhomirov , Roman Vershynin

In order to have a better understanding of finite random matrices with non-Gaussian entries, we study the $1/N$ expansion of local eigenvalue statistics in both the bulk and at the hard edge of the spectrum of random matrices. This gives…

Probability · Mathematics 2016-06-28 Alan Edelman , A. Guionnet , S. Péché

Let $M_n$ be an $n\times n$ signed random combinatorial matrix whose rows are independent and uniformly distributed over the set of $\{-1,0,1\}$-vectors with exactly $n/2$ zero coordinates. Despite the dependence induced by the row…

Probability · Mathematics 2026-04-14 Kexin Yu

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}$…

Probability · Mathematics 2017-02-16 Elizaveta Rebrova , Konstantin Tikhomirov

We present a simple, yet useful result about the expected value of the determinant of random sum of rank-one matrices. Computing such expectations in general may involve a sum over exponentially many terms. Nevertheless, we show that an…

Data Structures and Algorithms · Computer Science 2020-03-24 Kasra Khosoussi

We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…

Data Structures and Algorithms · Computer Science 2025-09-29 Aditya Bhaskara , Eric Evert , Vaidehi Srinivas , Aravindan Vijayaraghavan

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 i.i.d. entries of zero mean, unit variance and a bounded subgaussian moment. We show that the condition number $s_{\max}(A)/s_{\min}(A)$ satisfies the small ball probability estimate $${\mathbb…

Probability · Mathematics 2019-06-18 Alexander E. Litvak , Konstantin Tikhomirov , Nicole Tomczak-Jaegermann

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

Probability · Mathematics 2022-11-02 Giorgio Cipolloni , László Erdős , Dominik Schröder

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

Probability · Mathematics 2019-09-10 Asaf Ferber , Vishesh Jain

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

Probability · Mathematics 2024-04-22 Mohammed Osman

Let $\{a_{ij}\}$ $(1\le i,j<\infty)$ be i.i.d. real valued random variables with zero mean and unit variance and let an integer sequence $(N_m)_{m=1}^\infty$ satisfy $m/N_m\longrightarrow z$ for some $z\in(0,1)$. For each $m\in{\mathbb N}$…

Probability · Mathematics 2014-10-24 Konstantin Tikhomirov

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

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Combinatorics · Mathematics 2008-08-06 Terence Tao , Van Vu

In this note, we show that the norm of an $n\times n$ random jointly exchangeable matrix with zero diagonal can be estimated in terms of the norm of its $n/2\times n/2$ submatrix located in the top right corner. As a consequence, we prove a…

Probability · Mathematics 2019-01-07 Konstantin Tikhomirov , Pierre Youssef

We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in…

Probability · Mathematics 2021-12-03 Zipei Nie

We consider an $n\times n$ matrix of independent real Gaussian random variables and determine the asymptotic distribution of the smallest gaps between complex eigenvalues.

Probability · Mathematics 2024-04-01 Patrick Lopatto , Matthew Meeker