Spectral Analysis and the Dynamic Response of Complex Networks
arXiv:nlin/0406043 · doi:10.1103/PhysRevE.71.016106
Abstract
The eigenvalues and eigenvectors of the connectivity matrix of complex networks contain information about its topology and its collective behavior. In particular, the spectral density of this matrix reveals important network characteristics: random networks follow Wigner's semicircular law whereas scale-free networks exhibit a triangular distribution. In this paper we show that the spectral density of hierarchical networks follow a very different pattern, which can be used as a fingerprint of modularity. Of particular importance is the value , related to the homeostatic response of the network: it is maximum for random and scale free networks but very small for hierarchical modular networks. It is also large for an actual biological protein-protein interaction network, demonstrating that the current leading model for such networks is not adequate.
4 pages 14 figures
References in corpus (13)
- Statistical mechanics of complex networks
- Error and attack tolerance of complex networks
- Hierarchical organization of modularity in metabolic networks
- The large-scale organization of metabolic networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Connectivity of Growing Random Networks
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Spectra of complex networks
- Scale-free Networks from Optimal Design
- Mean-field theory for clustering coefficients in Barabasi-Albert networks
- Small-world networks and the conformation space of a lattice polymer chain
- Exact scaling properties of a hierarchical network model
- Spectral statistics near the quantum percolation threshold
Cited by in corpus (33)
- Biological network comparison using graphlet degree distribution
- Approximating the largest eigenvalue of network adjacency matrices
- Functional Integration of Ecological Networks through Pathway Proliferation
- Universality in Complex Networks: Random Matrix Analysis
- Random matrix analysis of complex networks
- Spectral properties of complex networks
- Understanding cancer complexome using networks, spectral graph theory and multilayer framework
- Random matrix analysis of localization properties of Gene co-expression network
- Uncovering Randomness and Success in Society
- A multilayer PPI network analysis of different life stages in C. elegans
- Randomness and preserved patterns in cancer network
- How much random a random network is : a random matrix analysis
- Level statistics of real eigenvalues in non-Hermitian systems
- Spectral Properties of Directed Random Networks with Modular Structure
- Spectral analysis of deformed random networks
- Quantifying randomness in protein-protein interaction networks of different species: A random matrix approach
- Origin and implications of zero degeneracy in networks spectra
- Effect of Unfolding on the Spectral Statistics of Adjacency Matrices of Complex Networks
- Analysing degeneracies in networks spectra
- Spectral properties of hyperbolic nano-networks with tunable aggregation of simplexes
- Collective Chaos Induced by Structures of Complex Networks
- Modeling social resilience: Questions, answers, open problems
- Synchronizabilities of Networks: A New index
- Towards a common thread in Complexity: an accuracy-based approach
- Assortative and disassortative mixing investigated using the spectra of graphs
- On the spectral unfolding of chaotic and mixed systems
- Phase-Space Networks of Geometrical Frustrated Systems
- Dissortativity and duplications in Oral cancer
- From Spectra to Localized Networks: A Reverse Engineering Approach
- Spacing ratio statistics of multiplex directed networks
- Null-eigenvalue localization of quantum walks on real-world complex networks
- Random Matrix Analysis of Multiplex Networks
- Phase-space networks and connectivity of the kagome antiferromagnet