Related papers: Spectral Density of Sparse Sample Covariance Matri…
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 describe a method to determine the eigenvalue density of empirical covariance matrix in the presence of correlations between samples. This is a straightforward generalization of the method developed earlier by the authors for…
We develop a theoretical approach to compute the conditioned spectral density of $N \times N$ non-invariant random matrices in the limit $N \rightarrow \infty$. This large deviation observable, defined as the eigenvalue distribution…
Covariance matrix of heights measured relative to the average height of a growing self-affine surface in the steady state are investigated in the framework of random matrix theory. We show that the spectral density of the covariance matrix…
The eigendecomposition of the coupling matrix of large biological networks is central to the study of the dynamics of these networks. For neural networks, this matrix should reflect the topology of the network and conform with Dale's law…
We present an analytic method for calculating spectral densities of empirical covariance matrices for correlated data. In this approach the data is represented as a rectangular random matrix whose columns correspond to sampled states of the…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We apply random matrix theory to derive spectral density of large sample covariance matrices generated by multivariate VMA(q), VAR(q) and VARMA(q1,q2) processes. In particular, we consider a limit where the number of random variables N and…
In physics, it is sometimes desirable to compute the so-called \emph{Density Of States} (DOS), also known as the \emph{spectral density}, of a real symmetric matrix $A$. The spectral density can be viewed as a probability density…
We investigate the spectral distribution of large sample covariance matrices with independent columns and entries in the columns that stem from Markov chains. We characterize the limiting spectral densities by their moments.…
The salient properties of large empirical covariance and correlation matrices are studied for three datasets of size 54, 55 and 330. The covariance is defined as a simple cross product of the returns, with weights that decay logarithmically…
Using the diagrammatic method, we derive a set of self-consistent equations that describe eigenvalue distributions of large correlated asymmetric random matrices. The matrix elements can have different variances and be correlated with each…
We review the problem of how to compute the spectral density of sparse symmetric random matrices, i.e. weighted adjacency matrices of undirected graphs. Starting from the Edwards-Jones formula, we illustrate the milestones of this line of…
The density of complex eigenvalues of random asymmetric $N\times N$ matrices is found in the large-$N$ limit. The matrices are of the form $H_0+A$ where $A$ is a matrix of $N^2$ independent, identically distributed random variables with…
We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…
Statistical properties of non--symmetric real random matrices of size $M$, obtained as truncations of random orthogonal $N\times N$ matrices are investigated. We derive an exact formula for the density of eigenvalues which consists of two…
We compute exact asymptotic of the statistical density of random matrices belonging to invariant random matrices ensemble (RMT) orthogonal, unitary and symplectic ensembles, where all its eigenvalues lie within the interval $[\sigma,…
In contrast to the neatly bounded spectra of densely populated large random matrices, sparse random matrices often exhibit unbounded eigenvalue tails on the real and imaginary axis, called Lifshitz tails. In the case of asymmetric matrices,…
We propose new methods for multivariate linear regression when the regression coefficient matrix is sparse and the error covariance matrix is dense. We assume that the error covariance matrix has equicorrelation across the response…
We consider large complex random sample covariance matrices obtained from "spiked populations", that is when the true covariance matrix is diagonal with all but finitely many eigenvalues equal to one. We investigate the limiting behavior of…