Related papers: Random reversible Markov matrices with tunable ext…
Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral…
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…
In this note, we give a precise description of the limiting empirical spectral distribution (ESD) for the non-backtracking matrices for an Erd\H{o}s-R\'{e}nyi graph assuming $np/\log n$ tends to infinity. We show that derandomizing part of…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graph ${\bf G}(N,p)$. For $N^{-1+o(1)}\leq p\leq 1/2$, we show that the non-trivial edge eigenvectors are asymptotically jointly normal.…
A large i.i.d. random matrix with deterministic low-rank perturbation has been extensively studied, particularly in the aspects of the ESD (Empirical Spectral Distribution) and the outliers of eigenvalues. In this work, we investigate the…
Spectral properties of random matrices play an important role in statistics, machine learning, communications, and many other areas. Engaging results regarding the convergence of the empirical spectral distribution (ESD) and the…
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…
In this paper, we study the convergence rates of empirical spectral distribution of large dimensional quaternion sample covariance matrix. Assume that the entries of $\mathbf X_n$ ($p\times n$) are independent quaternion random variables…
The eigenvector empirical spectral distribution (VESD) is a useful tool in studying the limiting behavior of eigenvalues and eigenvectors of covariance matrices. In this paper, we study the convergence rate of the VESD of sample covariance…
We analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…
Consider an $n \times p$ data matrix $X$ whose rows are independently sampled from a population with covariance $\Sigma$. When $n,p$ are both large, the eigenvalues of the sample covariance matrix are substantially different from those of…
Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…
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 analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…
We define the empirical spectral distribution (ESD) of a random matrix polynomial with invertible leading coefficient, and we study it for complex $n \times n$ Gaussian monic matrix polynomials of degree $k$. We obtain exact formulae for…
The distribution $\mathsf{RGG}(n,\mathbb{S}^{d-1},p)$ is formed by sampling independent vectors $\{V_i\}_{i = 1}^n$ uniformly on $\mathbb{S}^{d-1}$ and placing an edge between pairs of vertices $i$ and $j$ for which $\langle V_i,V_j\rangle…