English
Related papers

Related papers: Smallest Singular Value for Perturbations of Rando…

200 papers

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

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 $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ be an $n\times n$ random matrix with entries in ${0,1}$, where each row is independently and uniformly sampled from the set of all vectors in…

Probability · Mathematics 2026-04-14 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

This work analyzes singular-value spectra of weight matrices in pretrained transformer models to understand how information is stored at both ends of the spectrum. Using Random Matrix Theory (RMT) as a zero information hypothesis, we…

Machine Learning · Computer Science 2025-11-07 Max Staats , Matthias Thamm , Bernd Rosenow

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

Probability · Mathematics 2025-01-28 Guozheng Dai , Zeyan Song , Hanchao Wang

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

Probability · Mathematics 2024-12-13 Ioana Dumitriu , Yizhe Zhu

The smallest singular value and condition number play important roles in numerical linear algebra and the analysis of algorithms. In numerical analysis with randomness, many previous works make Gaussian assumptions, which are not general…

Probability · Mathematics 2022-11-09 Haoyu Wang

We consider a class of sparse random matrices of the form $A_n =(\xi_{i,j}\delta_{i,j})_{i,j=1}^n$, where $\{\xi_{i,j}\}$ are i.i.d.~centered random variables, and $\{\delta_{i,j}\}$ are i.i.d.~Bernoulli random variables taking value $1$…

Probability · Mathematics 2017-02-06 Anirban Basak , Mark Rudelson

We prove lower bounds for the smallest singular value of rectangular, multivariate Vandermonde matrices with nodes on the complex unit circle. The nodes are ``off the grid'', groups of nodes cluster, and the studied minimal singular value…

Numerical Analysis · Mathematics 2019-07-17 Stefan Kunis , Dominik Nagel

Let $A$ be an $N\times n$ random matrix whose entries are coordinates of an isotropic log-concave random vector in $\mathbb{R}^{Nn}$. We prove sharp lower tail estimates for the smallest singular value of $A$ in the following cases: (1)…

Probability · Mathematics 2025-08-26 Manuel Fernandez , Galyna V. Livshyts , Stephanie Mui

Computing the first few singular vectors of a large matrix is a problem that frequently comes up in statistics and numerical analysis. Given the presence of noise, exact calculation is hard to achieve, and the following problem is of…

Numerical Analysis · Mathematics 2010-04-13 Van Vu

In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…

Probability · Mathematics 2012-01-27 Florent Benaych-Georges , Raj Rao Nadakuditi

We establish precise right-tail small deviation estimates for the largest eigenvalue of real symmetric and complex Hermitian matrices whose entries are independent random variables with uniformly bounded moments. The proof relies on a Green…

Probability · Mathematics 2022-04-04 László Erdős , Yuanyuan Xu

The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…

Functional Analysis · Mathematics 2014-03-05 Mark Rudelson , Roman Vershynin

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

Probability · Mathematics 2026-04-14 Zeyan Song , Hanchao Wang

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

We study the deviation inequality for the spectral norm of structured random matrices with non-gaussian entries. In particular, we establish an optimal bound for the $p$-th moment of the spectral norm by transfering the spectral norm into…

Probability · Mathematics 2024-05-14 Guozheng Dai , Zhonggen Su

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

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

Probability · Mathematics 2017-10-10 Kyle Luh

We study a random walk on the subgroup of lower triangular matrices of SL$_2$, with i.i.d. increments. We prove that the process of the lower corner of the random walk satisfies a Rogers-Pitman criterion to be a Markov chain if and only if…

Probability · Mathematics 2024-09-04 Charlie Herent