Related papers: Eigenvalue spacings for regular graphs
We study the decrease of fluctuations of diagonal matrix elements of observables and of Husimi densities of quantum mechanical wave functions around their mean value upon approaching the semi-classical regime ($\hbar \rightarrow 0$). The…
Attention has been brought to the possibility that statistical fluctuation properties of several complex spectra, or, well-known number sequences may display strong signatures that the Hamiltonian yielding them as eigenvalues is…
Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…
We investigate the properties of sparse matrix ensembles with particular regard for the spectral ergodicity hypothesis, which claims the identity of ensemble and spectral averages of spectral correlators. An apparent violation of the…
In this work, we study a class of random matrices which interpolate between the Wigner matrix model and various types of patterned random matrices such as random Toeplitz, Hankel, and circulant matrices. The interpolation mechanism is…
Within random matrix theory for quantum dots, both the dot's one-particle eigenlevels and the dot-lead couplings are statistically distributed. While the effect of the latter on the conductance is obvious and has been taken into account in…
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 consider $m$ spinless Fermions in $l > m$ degenerate single-particle levels interacting via a $k$-body random interaction with Gaussian probability distribution and $k <= m$ in the limit $l$ to infinity (the embedded $k$-body random…
The role of the normalized modularity matrix in finding homogeneous cuts will be presented. We also discuss the testability of the structural eigenvalues and that of the subspace spanned by the corresponding eigenvectors of this matrix. In…
We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
Kolo\u{g}lu, Kopp and Miller compute the limiting spectral distribution of a certain class of real random matrix ensembles, known as $k$-block circulant ensembles, and discover that it is exactly equal to the eigenvalue distribution of an…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
Typical eigenstates of quantum systems, whose classical limit is chaotic, are well approximated as random states. Corresponding eigenvalue spectra is modeled through appropriate ensemble of random matrix theory. However, a small subset of…
Using the diagrammatic method, we derive a set of self-consistent equations that describe eigenvalue distributions of large correlated asymmetric random matrices. The matrix elements can have different variances and be correlated with each…
We study the spectrum of a random matrix, whose elements depend on the Euclidean distance between points randomly distributed in space. This problem is widely studied in the context of the Instantaneous Normal Modes of fluids and is…
We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
The ratio of two consecutive level spacings has emerged as a very useful metric in investigating universal features exhibited by complex spectra. It does not require the knowledge of density of states and is therefore quite convenient to…