Related papers: The singularity probability of a random symmetric …

In this article we consider products of real random matrices with fixed size. Let $A_1,A_2, \dots $ be i.i.d $k \times k$ real matrices, whose entries are independent and identically distributed from probability measure $\mu$. Let $X_n =…

This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…

We show that for an $n\times n$ random symmetric matrix $A_n$, whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable $\xi$ with mean $0$ and variance $1$, \[\mathbb{P}[s_n(A_n) \le…

We study invertibility of matrices of the form $D+R$ where $D$ is an arbitrary symmetric deterministic matrix, and $R$ is a symmetric random matrix whose independent entries have continuous distributions with bounded densities. We show that…

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $\sigma_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment,…

A conjecture of Barrett, Butler and Hall may be stated as follows: If $n \geq 3$ and $A \in \{0,1\}^{n \times n}$ (the family of $n \times n$ 0--1 matrices) is a nonsingular symmetric matrix, then the following two statements are…

Let $G_1,\dots,G_m$ be independent copies of the standard gaussian random vector in $\mathbb{R}^d$. We show that there is an absolute constant $c$ such that for any $A \subset S^{d-1}$, with probability at least $1-2\exp(-c\Delta m)$, for…

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…

In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability…

We analyze statistical properties of complex eigenvalues of random matrices $\hat{A}$ close to unitary. Such matrices appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with…

Let A be an n*n random matrix with mean zero and independent inhomogeneous non-constant subgaussian entries. We get that for any k<c\sqrt{n}, the probability of the matrix has a lower rank than n-k that is sub-exponential. Furthermore, we…

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…

The proof of Toda's celebrated theorem that the polynomial hierarchy is contained in $\P^{# P}$ relies on the fact that, under mild technical conditions on the complexity class $C$, we have $\exists C \subset BP \cdot \oplus C$. More…

Let $A = (a_{ij})$ be a square $n\times n$ matrix with i.i.d. zero mean and unit variance entries. Rudelson and Vershynin showed that the upper bound for a smallest singular value $s_n(A)$ is of order $n^{-\frac12}$ with probability close…

We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second…

A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…

Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…

I show that if a finite-dimensional density matrix has strictly smaller von Neumann entropy than a second one of the same dimension (and the rank is not bigger), then sufficiently (but finitely) many tensor-copies of the first density…

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…