arXiv · cond-mat/0606122
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J. G. Restrepo, E. Ott, B. R. Hunt. 2006-06-05. Characterizing the dynamical importance of network nodes and links. https://doi.org/10.1103/physrevlett.97.094102
Cite the original work for its findings. Save a collection to share your selection of sources.