Related papers: No-gaps delocalization for general random matrices

We study a class of holomorphic matrix models. The integrals are taken over middle dimensional cycles in the space of complex square matrices. As the size of the matrices tends to infinity, the distribution of eigenvalues is given by a…

We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

We compute analytically the probability distribution and moments of the sum and product of the non-zero eigenvalues and singular values of random matrices with (i) non-negative entries, (ii) fixed rank, and (iii) prescribed sums of the…

We prove estimates for $\mathbb{E} \| X: \ell_{p'}^n \to \ell_q^m\|$ for $p,q\ge 2$ and any random matrix $X$ having the entries of the form $a_{ij}Y_{ij}$, where $Y=(Y_{ij})_{1\le i\le m, 1\le j\le n}$ has i.i.d. isotropic log-concave…

The remarkable universality of the eigenvalue correlation functions is perhaps one of the most salient findings in random matrix theory. Particularly for short-range separations of the eigenvalues, the correlation functions have been shown…

Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

This is a continuation of our earlier paper on the universality of the eigenvalues of Wigner random matrices. The main new results of this paper are an extension of the results in that paper from the bulk of the spectrum up to the edge. In…

We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…

This note examines the implications of randomly selecting vectors from an infinite-dimensional Hilbert space on linear independence, assuming that for all $k$, the first $k$ vectors follow an absolutely continuous law with respect to a…

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

We consider general self-adjoint polynomials in several independent random matrices whose entries are centered and have the same variance. We show that under certain conditions the local law holds up to the optimal scale, i.e., the…

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…

We prove universality of local eigenvalue statistics in the bulk of the spectrum for orthogonal invariant matrix models with real analytic potentials with one interval limiting spectrum. Our starting point is the Tracy-Widom formula for the…