Let $M_n$ be an $n\times n$ random matrix with entries in $\{-1, 0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{-1, 0, 1\}^n$ containing exactly $d$ nonzero entries, with $d=pn$ for some fixed constant $p\in(0,1/2]$. A recent result by one of the authors gives a lower b...
Yu-Xiao Shi, Ze-Yan Song, Ke-Xin Yu et al.· 1 citation
Let $A$ be a deterministic real square matrix and $G$ a standard Gaussian matrix. We determine $\E\smin(A+G)$, up to universal constants, in terms of the singular values of $A$. The expectation is comparable to the square root of the smallest zero of the expected characteristic polynomial of $(A+G)^{\top}(A+G)$. This r...
Let $G_{n,d}$ be a uniformly random simple $d$-regular graph on $n$ vertices, and let $A_n$ be its adjacency matrix. For every fixed $\lambda\in(0,1/2)$, we prove that for any $\lambda(n-1)\le d\le(1-\lambda)(n-1)$, $\mathbb P(A_n\text{ is singular})\le e^{-cn}$, where $c>0$ depends only on $\lambda$, and $n$ is suffic...
Ze-Yan Song, Han-Chao Wang, Sheng-Yan Yin et al.· 0 citations
We resolve the Rademacher singularity conjecture: an $n\times n$ matrix with independent uniform $\{-1,1\}$ entries is singular with probability $(2+o(1))n^22^{-n}$. More generally, for an $n\times n$ matrix $M_n$ with independent entries uniform on a fixed set $S\subset\mathbb{R}$ of cardinality $q\ge2$, we prove $\ma...