• Corpus ID: 215238671

Singularity of sparse Bernoulli matrices

  title={Singularity of sparse Bernoulli matrices},
  author={Alexander E. Litvak and Konstantin E. Tikhomirov},
  journal={arXiv: Probability},
Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb P}\big\{\mbox{$M_n$ is singular}\big\}&=(1+o_n(1)){\mathbb P}\big\{\mbox{$M_n$ contains a zero row or column}\big\}\\ &=(2+o_n(1))n\,(1-p)^n, \end{align*} where $o_n(1)$ denotes a quantity which converges to zero as $n\to\infty$. We provide the corresponding upper and lower… 
Singularity of Bernoulli matrices in the sparse regime $pn = O(\log(n))$
This paper setted the conjecture that an A_n is singular matrix with i.i.d Bernoulli entries satisfies the sparse regime when p satisfies 1-o_n(1) for some large constant $C>1$.
Singularity of discrete random matrices II
Let $\xi$ be a non-constant real-valued random variable with finite support, and let $M_{n}(\xi)$ denote an $n\times n$ random matrix with entries that are independent copies of $\xi$. We show that,
Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
We consider three different models of sparse random graphs:~undirected and directed Erdős-Renyi graphs, and random bipartite graph with an equal number of left and right vertices. For such graphs we
The singularity probability of a random symmetric matrix is exponentially small
Let A be drawn uniformly at random from the set of all n × n symmetric matrices with entries in {−1, 1}. We show that P(det(A) = 0) 6 e, where c > 0 is an absolute constant, thereby resolving a
Robust Sparse Recovery with Sparse Bernoulli matrices via Expanders
Sparse binary matrices are of great interest in the field of compressed sensing. This class of matrices make possible to perform signal recovery with lower storage costs and faster decoding
The smallest singular value of random combinatorial matrices
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$


Invertibility of Sparse non-Hermitian matrices
The circular law for sparse non-Hermitian matrices
For 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 sub-Gaussian random variables of unit variance, and
On delocalization of eigenvectors of random non-Hermitian matrices
Lower bounds on delocalization of null vectors and eigenvectors of random matrices with i.i.d real subgaussian entries of zero mean and unit variance are found.
The smallest singular value of a shifted d-regular random square matrix
We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2
Circular law for the sum of random permutation matrices
If $\log^{12}n/(\log \log n)^{4} \le d=O(n)$, then the empirical spectral distribution of S_n^d/\sqrt{d}$ converges weakly to the circular law in probability as $n \to \infty$.
On the Increase of Dispersion of Sums of Independent Random Variables
Let $\xi _1 ,\xi _2 , \cdots ,\xi _n $ be independent random variables, \[ Q_k \{ l \} = \mathop {\sup }\limits_x {\bf P} \{ x \leqq \xi _k \leqq x + l \}, \]\[ Q(L) = \mathop {\sup }\limits_x {\bf
Singularity of random Bernoulli matrices
For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
The authors' bounds immediately yield the correct phase transition behavior of the spectral edge of random band matrices and of sparse Wigner matrices, and recover a result of Seginer on the norm of Rademacher matrices.
Invertibility of adjacency matrices for random d-regular graphs
Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*}