Related papers: Eigenvalue spacings for regular graphs
Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…
We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…
In this article we consider the spectrum of a Laplacian matrix, also known as the Markov matrix, under the independence assumption. We assume that the entries have a variance profile. Motivated by recent works on generalized Wigner matrices…
The connection between random matrices and the spectral fluctuations of complex quantum systems in a suitable limit can be explained by using the setup of random matrix theory. Higher-order spacing statistics in the $m$ superposed spectra…
The probability distribution of the closest neighbor and farther neighbor spacings from a given level have been studied for interacting fermion/boson systems with and without spin degree of freedom constructed using an embedded GOE of one…
We introduce a notion of local level spacings and study their statistics within a random-matrix-theory approach. In the limit of infinite-dimensional random matrices, we determine universal sequences of mean local spacings and of their…
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…
We propose a generalization of the random matrix theory following the basic prescription of the recently suggested concept of superstatistics. Spectral characteristics of systems with mixed regular-chaotic dynamics are expressed as weighted…
We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…
We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…
We discuss an approach to compute the first and second moments of the number of eigenvalues $I_N$ that lie in an arbitrary interval of the real line for $N \times N$ Gaussian random matrices. The method combines the standard…
The onset of quantum ergodicity is often quantified by the average ratio of consecutive level spacings. The reference values for ergodic quantum systems have been obtained numerically from the spectra of large but finite-dimensional random…
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…
We study the spectral properties of a class of random matrices where the matrix elements depend exponentially on the distance between uniformly and randomly distributed points. This model arises naturally in various physical contexts, such…
We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e. random graphs…
We show how the spectrum of a graph Laplacian changes with respect to a certain type of rank-one perturbation. We apply our finding to give new short proofs of the spectral version of Kirchhoff's Matrix Tree Theorem and known derivations…
We consider an $N$ by $N$ real or complex generalized Wigner matrix $H_N$, whose entries are independent centered random variables with uniformly bounded moments. We assume that the variance profile, $s_{ij}:=\mathbb{E} |H_{ij}|^2$,…
The properties of eigenvalues of large dimensional random matrices have received considerable attention. One important achievement is the existence and identification of the limiting spectral distribution of the empirical spectral…
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…