Related papers: Eigenvalue spacings for regular graphs

The local spectral statistics of random matrices forms distinct universality classes, strongly depending on the position in the spectrum. Surprisingly, the spacing between consecutive eigenvalues at the spectral edges has received little…

In this article, the joint fluctuations of the extreme eigenvalues and eigenvectors of a large dimensional sample covariance matrix are analyzed when the associated population covariance matrix is a finite-rank perturbation of the identity…

We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…

In recent studies of many-body localization in nonintegrable quantum systems, the distribution of the ratio of two consecutive energy level spacings, $r_n=(E_{n+1}-E_n)/(E_{n}-E_{n-1})$ or $\tilde{r}_n=\min(r_n,r_n^{-1})$, has been used as…

We analyze graphs attaining the extreme values of various spectral indices in the class of all simple connected graphs, as well as in the class of graphs which are not complete multipartite graphs. We also present results on density of…

Network modeling based on ensemble averages tacitly assumes that the networks meant to be modeled are typical in the ensemble. Previous research on network eigenvalues, which govern a range of dynamical phenomena, has shown that this is…

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…

We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

We investigate spacing statistics $p(s)$ and distribution of eigenvalues $D(\epsilon)$ for ensembles of various real random matrices (of order $n \times n, n=2$ and $n>>2$) where the matrix-elements have various Probability Distribution…

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…

Let $N(L)$ be the number of eigenvalues, in an interval of length $L$, of a matrix chosen at random from the Gaussian Orthogonal, Unitary or Symplectic ensembles of ${\cal N}$ by ${\cal N}$ matrices, in the limit ${\cal…

We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…

The extreme eigenvalues of connectivity matrices govern the influence of the network structure on a number of network dynamical processes. A fundamental open question is whether the eigenvalues of large networks are well represented by…

We discuss a random matrix model of systems with an approximate symmetry and present the spectral fluctuation statistics and eigenvector characteristics for the model. An acoustic resonator like, e.g., an aluminium plate may have an…

We consider a class of sparse random matrices which includes the adjacency matrix of the Erd\H{o}s-R\'enyi graph $\mathcal{G}(N,p)$. We show that if $N^{\varepsilon} \leq Np \leq N^{1/3-\varepsilon}$ then all nontrivial eigenvalues away…

We present a spectral-theoretic approach to time-average statistical mechanics for general, non-equilibrium initial conditions. We consider the statistics of bounded, local additive functionals of reversible as well as irreversible ergodic…

Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H^k_n(G)$ is produced when the preceding constructions are repeated $n$…

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 study the eigenvector mass distribution of an $N\times N$ Wigner matrix on a set of coordinates $I$ satisfying $| I | \ge c N$ for some constant $c >0$. For eigenvectors corresponding to eigenvalues at the spectral edge, we show that the…