Related papers: Singularity of random symmetric matrices -- a comb…

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

In this paper, we investigate the invertibility of sparse symmetric matrices. We show that for an $n\times n$ sparse symmetric random matrix $A$ with $A_{ij} = \delta_{ij} \xi_{ij}$ is invertible with high probability. Here, $\delta_{ij}$s,…

The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…

We show that in the Lorentz mirror model, at any density of mirrors, the probability of a particle starting at the origin to reach distance n is at least 1/(2n+1).

Let $A_1, A_2, \ldots, A_n$ be events in a sample space. Given the probability of the intersection of each collection of up to $k+1$ of these events, what can we say about the probability that at least $r$ of the events occur? This question…

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

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…

Consider a truncated circular unitary matrix which is a $p_n$ by $p_n$ submatrix of an $n$ by $n$ circular unitary matrix by deleting the last $n-p_n$ columns and rows. Jiang and Qi (2017) proved that the maximum absolute value of the…

Let $m \geq 1$ and consider the product of $m$ independent $n \times n$ matrices $\mathbf{W} = \mathbf{W}_1 \dots \mathbf{W}_m$, each $\mathbf{W}_{i}$ with i.i.d. normalised $\mathcal{N}(0, n^{-1/2})$ entries. It is shown in Penson et al.…

Let $P(d)$ be the probability that a random 0/1-matrix of size $d \times d$ is singular, and let $E(d)$ be the expected number of 0/1-vectors in the linear subspace spanned by d-1 random independent 0/1-vectors. (So $E(d)$ is the expected…

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…

We provide some upper bounds for the Mertens function ($M(n)$: the cumulative sum of the M$\ddot{\mathrm{o}}$bius function) by an approach of statistical mechanics, in which the M$\ddot{\mathrm{o}}$bius function is taken as a particular…

In this paper, we study the effect of sparsity on the appearance of outliers in the semi-circular law. Let $(W_n)_{n=1}^\infty$ be a sequence of random symmetric matrices such that each $W_n$ is $n\times n$ with i.i.d entries above and on…

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…