English
Related papers

Related papers: Least Non-Zero Singular Value and the Distribution…

200 papers

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

Probability · Mathematics 2018-05-21 Nicholas A. Cook

We prove the universality of the joint distribution of an eigenvalue and the corresponding diagonal eigenvector overlap, in the bulk and at the edge, for eigenvalues of complex matrices and real eigenvalues of real matrices. As part of the…

Probability · Mathematics 2025-01-03 Mohammed Osman

Finite sample properties of random covariance-type matrices have been the subject of much research. In this paper we focus on the "lower tail" of such a matrix, and prove that it is subgaussian under a simple fourth moment assumption on the…

Probability · Mathematics 2013-12-11 Roberto Imbuzeiro Oliveira

We propose a variational tail bound for norms of random vectors under moment assumptions on their one-dimensional marginals. A simplified version of the bound that parametrizes the ``aggregating distribution'' using a certain pushforward of…

Probability · Mathematics 2026-02-02 Sohail Bahmani

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

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

In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…

Disordered Systems and Neural Networks · Physics 2025-11-07 Pietro Valigi , Joseph W. Baron , Izaak Neri , Giulio Biroli , Chiara Cammarota

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

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…

Probability · Mathematics 2014-04-29 Joel A. Tropp

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

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Probability · Mathematics 2011-07-22 Alex Gittens , Joel A. Tropp

We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit…

Probability · Mathematics 2011-05-16 Daniel Hsu , Sham M. Kakade , Tong Zhang

The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are…

Probability · Mathematics 2013-05-29 Michael I. Tribelsky

Suppose $X$ is an $N \times n$ complex matrix whose entries are centered, independent, and identically distributed random variables with variance $1/n$ and whose fourth moment is of order ${\mathcal O}(n^{-2})$. In the first part of the…

Probability · Mathematics 2019-09-30 Arup Bose , Walid Hachem

We consider $N\times N$ non-Hermitian random matrices of the form $X+A$, where $A$ is a general deterministic matrix and $\sqrt{N}X$ consists of independent entries with zero mean, unit variance, and bounded densities. For this ensemble, we…

Probability · Mathematics 2023-06-06 László Erdős , Hong Chang Ji

In this paper, we obtain a refined non-asymptotic tail bound for the largest singular value (the soft edge) of sub-Gaussian matrix. As an application, we use the obtained theorem to compute the tail bound of the Gaussian Toeplitz matrix.

Probability · Mathematics 2019-06-26 Xianjie Gao , Hongwei Zhang

This work is concerned with finite range bounds on the variance of individual eigenvalues of Wigner random matrices, in the bulk and at the edge of the spectrum, as well as for some intermediate eigenvalues. Relying on the GUE example,…

Probability · Mathematics 2012-07-06 Sandrine Dallaporta

This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…

Probability · Mathematics 2025-01-29 Joel A. Tropp

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be used to study the…

Machine Learning · Computer Science 2019-10-10 Chao Zhang , Min-Hsiu Hsieh , Dacheng Tao
‹ Prev 1 2 3 10 Next ›