English
Related papers

Related papers: The smallest singular value of deformed random rec…

200 papers

Let $\sigma_n(\cdot)$ denote the least singular value of a $n \times n$ matrix. It is well-known that $\mathbb{P}[\sigma_n(A) \le \varepsilon] \le \varepsilon n$ if $A$ is drawn from the real Ginibre ensemble of $n \times n$ matrices and…

Probability · Mathematics 2022-06-10 Edward Zeng

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.

Numerical Analysis · Mathematics 2022-05-30 Shun Xu

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 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 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

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

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

We consider the recovery of a low rank $M \times N$ matrix $S$ from its noisy observation $\tilde{S}$ in two different regimes. Under the assumption that $M$ is comparable to $N$, we propose two consistent estimators for $S$. Our analysis…

Statistics Theory · Mathematics 2019-04-24 Xiucai Ding

An unknown $m$ by $n$ matrix $X_0$ is to be estimated from noisy measurements $Y=X_0+Z$, where the noise matrix $Z$ has i.i.d. Gaussian entries. A popular matrix denoising scheme solves the nuclear norm penalization problem $\operatorname…

Statistics Theory · Mathematics 2014-11-05 David Donoho , Matan Gavish

Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…

Algebraic Geometry · Mathematics 2025-12-02 Alvaro Ribot , Emil Horobet , Anna Seigal , Ettore Teixeira Turatti

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

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

In many practical situations we would like to estimate the covariance matrix of a set of variables from an insufficient amount of data. More specifically, if we have a set of $N$ independent, identically distributed measurements of an $M$…

Probability · Mathematics 2010-10-05 Thomas L. Marzetta , Gabriel H. Tucci , Steven H. Simon

The goal of this note is to study the smallest conic singular value of a matrix from a Lagrangian duality viewpoint and provide an efficient method for its computation.

Numerical Analysis · Mathematics 2018-07-10 Stephane Chretien

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Combinatorics · Mathematics 2020-10-20 Marcelo Campos , Letícia Mattos , Robert Morris , Natasha Morrison

We study the least singular value of the $n\times n$ matrix $H-z$ with $H=A_0+H_0$, where $H_0$ is drawn from the complex Ginibre ensemble of matrices with iid Gaussian entries, and $A_0$ is some general $n\times n$ matrix with complex…

Mathematical Physics · Physics 2022-10-19 Mariya Shcherbina , Tatyana Shcherbina

To recover a low rank structure from a noisy matrix, truncated singular value decomposition has been extensively used and studied. Recent studies suggested that the signal can be better estimated by shrinking the singular values. We pursue…

Methodology · Statistics 2014-11-25 Julie Josse , Sylvain Sardy