Characterizing the dynamical importance of network nodes and links

Abstract

The largest eigenvalue of the adjacency matrix of the networks is a key quantity determining several important dynamical processes on complex networks. Based on this fact, we present a quantitative, objective characterization of the dynamical importance of network nodes and links in terms of their effect on the largest eigenvalue. We show how our characterization of the dynamical importance of nodes can be affected by degree-degree correlations and network community structure. We discuss how our characterization can be used to optimize techniques for controlling certain network dynamical processes and apply our results to real networks.

4 pages, 4 figures

References in corpus (2)

• Efficient Immunization Strategies for Computer Networks and Populations
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects

Cited by in corpus (10)

• Synchronization in complex networks
• Creative elements: network-based predictions of active centres in proteins, cellular and social networks
• Dynamical and spectral properties of complex networks
• Random matrix analysis of complex networks
• Statistical properties of sampled networks by random walks
• Weighted percolation on directed networks
• Dynamics on Complex Networks and Applications
• Bounding network spectra for network design
• Impact of hierarchical modular structure on ranking of individual nodes in directed networks
• Analysis of relative influence of nodes in directed networks