Related papers: Natural statistics for spectral samples
We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…
The full spectrum of transfer matrices of the general eight-vertex model on a square lattice is obtained by numerical diagonalization. The eigenvalue spacing distribution and the spectral rigidity are analyzed. In non-integrable regimes we…
Using the superstatistics method, we propose an extension of the random matrix theory to cover systems with mixed regular-chaotic dynamics. Unlike most of the other works in this direction, the ensembles of the proposed approach are basis…
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,…
We address the question as to why, in the semiclassical limit, classically chaotic systems generically exhibit universal quantum spectral statistics coincident with those of Random Matrix Theory. To do so, we use a semiclassical resummation…
The statistical properties of a Hamiltonian $H_0$ perturbed by a localized scatterer are considered. We prove that when $H_0$ describes a bounded chaotic motion, the universal part of the spectral statistics are not changed by the…
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…
We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first k eigenvectors of the similarity matrix' Laplacian,…
Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
In this article we study the fluctuation of linear statistics of eigenvalues of circulant, symmetric circulant, reverse circulant and Hankel matrices. We show that the linear spectral statistics of these matrices converges to the Gaussian…
It recently has been found that methods of the statistical theories of spectra can be a useful tool in the analysis of spectra far from levels of Hamiltonian systems. Several examples originate from areas, such as quantitative linguistics…
We give a brief account of the interplay between spectral morphisms, K-theory, and stable ranks in the context of Banach algebras.
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
Spectral clustering is a powerful unsupervised machine learning algorithm for clustering data with non convex or nested structures. With roots in graph theory, it uses the spectral properties of the Laplacian matrix to project the data in a…
The autocorrelation function of spectral determinants is proposed as a convenient tool for the characterization of spectral statistics in general, and for the study of the intimate link between quantum chaos and random matrix theory, in…
We derive concentration inequalities for the spectral measure of large random matrices, allowing for certain forms of dependence. Our main focus is on empirical covariance (Wishart) matrices, but general symmetric random matrices are also…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
Statistics derived from the eigenvalues of sample covariance matrices are called spectral statistics, and they play a central role in multivariate testing. Although bootstrap methods are an established approach to approximating the laws of…