Related papers: The smallest singular value of a shifted $d$-regul…
We prove that the (non-symmetric) adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices is asymptotically almost surely invertible, assuming $\min(d,n-d)\ge C\log^2n$ for a sufficiently large constant $C>0$. The…
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…
We consider a square random matrix made by i.i.d. rows with any distribution and prove that, for any given dimension, the probability for the least singular value to be in [0; $\epsilon$) is at least of order $\epsilon$. This allows us to…
Let $M$ be an $n\times n$ random i.i.d. matrix. This paper studies the deviation inequality of $s_{n-k+1}(M)$, the $k$-th smallest singular value of $M$. In particular, when the entries of $M$ are subgaussian, we show that for any…
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…
Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…
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…
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…
Let $A \in \mathbb{R}^{N \times n}$ ($N \geq n$) be a random matrix with with independent entries that have mean 0 variance 1 and bounded $2+\beta$ moment. We show that the smallest singular value $\sigma_n(A)$ satisfies \[ \Pr…
Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…
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…
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…
Let $A_n$ be an $n\times n$ random symmetric matrix with $(A_{ij})_{i< j}$ i.i.d. mean $0$, variance 1, following a subGaussian distribution and diagonal elements i.i.d. following a subGaussian distribution with a fixed variance. We…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…
Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…
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)…
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…
Given $X$ a random vector in ${\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\Gamma=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$ be the matrix whose rows are $\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$.…
The Cheeger constant of a graph is the smallest possible ratio between the size of a subgraph and the size of its boundary. It is well known that this constant must be at least $\frac{\lambda_1}{2}$, where $\lambda_1$ is the smallest…
We consider the spectral gap of a uniformly chosen random $(d_1,d_2)$-biregular bipartite graph $G$ with $|V_1|=n, |V_2|=m$, where $d_1,d_2$ could possibly grow with $n$ and $m$. Let $A$ be the adjacency matrix of $G$. Under the assumption…