Effect of Unfolding on the Spectral Statistics of Adjacency Matrices of Complex Networks

Abstract

Random matrix theory is finding an increasing number of applications in the context of information theory and communication systems, especially in studying the properties of complex networks. Such properties include short-term and long-term correlation. We study the spectral fluctuations of the adjacency of networks using random-matrix theory. We consider the influence of the spectral unfolding, which is a necessary procedure to remove the secular properties of the spectrum, on different spectral statistics. We find that, while the spacing distribution of the eigenvalues shows little sensitivity to the unfolding method used, the spectral rigidity has greater sensitivity to unfolding.

Complex Adaptive Systems Conference 2012

References in corpus (4)

• Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
• Spectral Analysis and the Dynamic Response of Complex Networks
• Spectral transitions in networks
• Statistical Analysis of Composite Spectra

Cited by in corpus (8)

• Spacing ratio characterization of the spectra of directed random networks
• Connectivity Analysis of Directed Highway VANETs using Graph Theory
• Normal mode analysis of spectra of random networks
• On the spectral unfolding of chaotic and mixed systems
• On the similarity between Nakagami-m Fading distribution and the Gaussian ensembles of random matrix theory
• Quantum percolation on Lieb Lattices
• Signatures of spectral crossovers in the short- and long-range spectral correlations of a disordered spin-chain with Kramers degeneracy
• Appearance of Random Matrix Theory in Deep Learning