Related papers: The Mar\v{c}enko-Pastur law for sparse random bipa…
We prove a local law in the bulk of the spectrum for random Gram matrices $XX^*$, a generalization of sample covariance matrices, where $X$ is a large matrix with independent, centered entries with arbitrary variances. The limiting…
In random matrix theory, Marchenko-Pastur law states that random matrices with independent and identically distributed entries have a universal asymptotic eigenvalue distribution under large dimension limit, regardless of the choice of…
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with…
In this paper, we consider the empirical spectral distribution of the sample correlation matrix and investigate its asymptotic behavior under mild assumptions on the data's distribution, when dimension and sample size increase at the same…
Let $X$ be a matrix sampled uniformly from the set of doubly stochastic matrices of size $n\times n$. We show that the empirical spectral distribution of the normalized matrix $\sqrt{n}(X-{\mathbf {E}}X)$ converges almost surely to the…
In this paper we consider a new normalization of matrices obtained by choosing distinct codewords at random from linear codes over finite fields and find that under some natural algebraic conditions of the codes their empirical spectral…
We study random matrices whose entries are obtained by applying consistent rank correlations, such as Hoeffding's $D$, pairwise to a high-dimensional random vector with mutually independent components. Prior work has shown that, in the…
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…
This paper is concerned with extensions of the classical Mar\v{c}enko-Pastur law to time series. Specifically, $p$-dimensional linear processes are considered which are built from innovation vectors with independent, identically distributed…
In statistics, assuming samples are independent is reasonable. However, this property can fail to hold for the features, a distinction that has led to several lines of work aiming to remove the latter assumption of independence present in…
We study the spectral norm of random kernel matrices with polynomial scaling, where the number of samples scales polynomially with the data dimension. In this regime, Lu and Yau (2022) proved that the empirical spectral distribution…
We study the limiting spectral distribution of the normalized Laplacian $\mathcal L$ of an Erd\H{o}s-R\'enyi graph $G(n,p)$. To account for the presence of isolated vertices in the sparse regime, we define $\mathcal L$ using the…
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…
Bandeira et al. (2017) show that the eigenvalues of the Kendall correlation matrix of $n$ i.i.d. random vectors in $\mathbb{R}^p$ are asymptotically distributed like $1/3 + (2/3)Y_q$, where $Y_q$ has a Mar\v{c}enko-Pastur law with parameter…
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
The traditional class of elliptical distributions is extended to allow for asymmetries. A completely robust dispersion matrix estimator (the `spectral estimator') for the new class of `generalized elliptical distributions' is presented. It…
The spectral density of various ensembles of sparse symmetric random matrices is analyzed using the cavity method. We consider two cases: matrices whose associated graphs are locally tree-like, and sparse covariance matrices. We derive a…
We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…
We prove the Marchenko-Pastur theorem for random matrices with i.i.d. rows and a general dependence structure within the rows by a simple modification of the standard Cauchy-Stieltjes resolvent method.