April 29, 1999
Similar papers 2
December 11, 2015
In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is prescribed on the ensemble. Let $\mathbf{a}_{i,j} =1$ if there is an edge between the nodes $\{i,j\}$ and zero otherwise, and consider the normalized random adjacency matrix of the graph ensemble: $\mathbf{A}_n$ $=$ $ [\mathbf{a}_{i,j}/\sqrt...
April 19, 2016
We consider an $N$ by $N$ real symmetric random matrix $X=(x_{ij})$ where $\mathbb{E}x_{ij}x_{kl}=\xi_{ijkl}$. Under the assumption that $(\xi_{ijkl})$ is the discretization of a piecewise Lipschitz function and that the correlation is short-ranged we prove that the empirical spectral measure of $X$ converges to a probability measure. The Stieltjes transform of the limiting measure can be obtained by solving a functional equation. Under the slightly stronger assumption that $...
July 27, 2015
We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the average number of edges attached to one vertex is $\alpha\cdot p$ or $(1-\alpha)\cdot p$. To each edge of the graph $e_{ij}$ we assign a weight given by a random variable $a_{ij}$ with the finite second moment. We consider the resolvents $G...
March 14, 2011
The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of the entries of the matrix. In this paper, we extend the four moment theorem to also cover the coefficients of the \emph{eigenvectors} of a Wigner random matrix. A similar result (with different hypotheses) has been proved recently by Knowle...
April 15, 2019
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graphs $\mathcal G(N,p)$ for $p \in [N^{\varepsilon-1},N^{-\varepsilon}]$. We identify the joint limiting distributions of the eigenvalues away from 0 and the spectral edges. Our result indicates that unlike Wigner matrices, the eigenvalues of sparse matrices satisfy central limit theorems with normalization $N\sqrt{p}$. In addition, the eigenvalues fluctuate simultaneously...
April 18, 2011
We study the renormalized real sample covariance matrix $H=X^TX/\sqrt{MN}-\sqrt{M/N}$ with $N/M\rightarrow0$ as $N, M\rightarrow \infty$ in this paper. And we always assume $M=M(N)$. Here $X=[X_{jk}]_{M\times N}$ is an $M\times N$ real random matrix with i.i.d entries, and we assume $\mathbb{E}|X_{11}|^{5+\delta}<\infty$ with some small positive $\delta$. The Stieltjes transform $m_N(z)=N^{-1}Tr(H-z)^{-1}$ and the linear eigenvalue statistics of $H$ are considered. We mainly ...
January 17, 2011
We consider two classical ensembles of the random matrix theory: the Wigner matrices and sample covariance matrices, and prove Central Limit Theorem for linear eigenvalue statistics under rather weak (comparing with results known before) conditions on the number of derivatives of the test functions and also on the number of the entries moments. Moreover, we develop a universal method which allows one to obtain automatically the bounds for the variance of differentiable test f...
May 30, 2017
We consider large random matrices with a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent away from the spectral edges, generalizing the recent result of [arXiv:1604.08188] to allow slow correlation decay and arbitrary expectation. The main novel tool is a systematic diagrammatic control of a multivariate cumulant expansion.
August 13, 2021
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical systems. In this letter, we study the eigenvalue spectrum of an ensemble of random matrices with correlations between any pair of elements. To this end, we introduce an analytical method that maps the resolvent of the random matrix onto the resp...
September 9, 2008
We obtain the recursive identities for the joint moments of the traces of the powers of the resolvent for Gaussian ensembles of random matrices at the soft and hard edges of the spectrum. We also discuss the possible ways to extend these results to the non-Gaussian case.