Related papers: On the spectral distribution of large weighted ran…

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

We propose a novel method to test the existence of community structure of undirected real-valued edge-weighted graph. The method is based on Wigner semicircular law on the asymptotic behavior of the random distribution for eigenvalues of a…

We derive the limiting distribution for the largest eigenvalues of the adjacency matrix for a stochastic blockmodel graph when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate…

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…

We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

We propose a theoretical framework to study the eigenvalue spectra of the controllability Gramian of systems with random state matrices, such as networked systems with a random graph structure. Using random matrix theory, we provide…

We consider the eigenvalues of sample covariance matrices of the form $\mathcal{Q}=(\Sigma^{1/2}X)(\Sigma^{1/2}X)^*$. The sample $X$ is an $M\times N$ rectangular random matrix with real independent entries and the population covariance…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and $p$-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar…

We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…

We study the spectral properties of the adjacency matrix in the giant connected component of Erd\"os-R\'enyi random graphs, with average connectivity $p$ and randomly distributed hopping amplitudes. By solving the self-consistent cavity…

We consider the ensemble of real symmetric random matrices $H^{(n,\rho)}$ obtained from the determinant form of the Ihara zeta function of random graphs that have $n$ vertices with the edge probability $\rho/n$. We prove that the normalized…

This paper examines the spectral characterizations of oriented graphs. Let $\Sigma$ be an $n$-vertex oriented graph with skew-adjacency matrix $S$. Previous research mainly focused on self-converse oriented graphs, proposing arithmetic…

We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…

This work is concerned with finite range bounds on the variance of individual eigenvalues of Wigner random matrices, in the bulk and at the edge of the spectrum, as well as for some intermediate eigenvalues. Relying on the GUE example,…

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

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…