Related papers: Universality and the circular law for sparse rando…

We use methods of random matrix theory to analyze the cross-correlation matrix C of price changes of the largest 1000 US stocks for the 2-year period 1994-95. We find that the statistics of most of the eigenvalues in the spectrum of C agree…

After proper rescaling and under some technical assumptions, the smallest eigenvalue of a sample covariance matrix with aspect ratio bounded away from 1 converges to the Tracy--Widom distribution. This complements the results on the largest…

We consider random matrices whose entries are f(<Xi,Xj>) or f(||Xi-Xj||^2) for iid vectors Xi in R^p with normalized distribution. Assuming that f is sufficiently smooth and the distribution of Xi's is sufficiently nice, El Karoui [17]…

This paper is to investigate the spectral properties of sample covariance matrices under a more general population. We consider a class of matrices of the form $\mathbf S_n=\frac1n\mathbf B_n\mathbf X_n\mathbf X_n^*\mathbf B_n^*$, where…

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

We consider the non-Hermitian analogue of the celebrated Wigner-Dyson-Mehta bulk universality phenomenon, i.e. that in the bulk the local eigenvalue statistics of a large random matrix with independent, identically distributed centred…

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 paper, we prove a universality result for the limiting distribution of persistence diagrams arising from geometric filtrations over random point processes. Specifically, we consider the distribution of the ratio of persistence…

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

We consider $N\times N$ random matrices of the form $H=W+V$ where $W$ is a real symmetric or complex Hermitian Wigner matrix and $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume…

Consider an ensemble of $N\times N$ non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded…

We investigate random matrices whose entries are obtained by applying a nonlinear kernel function to pairwise inner products between $n$ independent data vectors, drawn uniformly from the unit sphere in $\mathbb{R}^d$. This study is…

We investigate the universality of microscopic eigenvalue correlations for Random Matrix Theories with the global symmetries of the QCD partition function. In this article we analyze the case of real valued chiral Random Matrix Theories…

Consider $N\times N$ symmetric one-dimensional random band matrices with general distribution of the entries and band width $W \geq N^{3/4+\varepsilon}$ for any $\varepsilon>0$. In the bulk of the spectrum and in the large $N$ limit, we…

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 present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides…

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…

Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…

The Sparre-Andersen theorem is a remarkable result in one-dimensional random walk theory concerning the universality of the ubiquitous first-passage-time distribution. It states that the probability distribution $\rho_n$ of the number of…