Related papers: Singularity of random integer matrices with large …
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…
Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…
Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…
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 generalizations are considered.
We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…
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 $\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$. For $\xi$ which is not uniform on its support, we show…
Permanents of random matrices with independent and identically distributed (i.i.d.) entries have extensively studied in literature and convergence and concentration properties are known under varying assumptions on the distributions. In…
For a fixed $n\ge2$, consider an $n\times n$ matrix $M$ whose entries are random integers bounded by $k$ in absolute value. In this paper, we examine the probability that $M$ is singular (hence has eigenvalue 0), and the probability that…
We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…
In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.
In this note we describe the singular locus of diagonally-dominant Hermitian matrices with nonnegative diagonal entries over the reals, the complex numbers, and the quaternions. This yields explicit expressions for the probability that such…
Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…
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…
It is shown that a random $(0,1)$ matrix whose rows are independent random vectors of exactly $n/2$ zero components is non-singular with probability $1-O(n^{-C})$ for any $C>0$. The proof uses a non-standard inverse-type Littlewood-Offord…
Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…
Random matrices arise in many mathematical contexts, and it is natural to ask about the properties that such matrices satisfy. If we choose a matrix with integer entries at random, for example, what is the probability that it will have a…
This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…
Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.