# Characterizing the dynamical importance of network nodes and links.

@article{Restrepo2006CharacterizingTD, title={Characterizing the dynamical importance of network nodes and links.}, author={Juan G. Restrepo and Edward Ott and Brian R. Hunt}, journal={Physical review letters}, year={2006}, volume={97 9}, pages={ 094102 } }

The largest eigenvalue of the adjacency matrix of 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…

## 135 Citations

### Dynamical and spectral properties of complex networks

- Mathematics, Computer Science
- 2007

The main dependence of the synchronization time is on the smallest nonzero eigenvalue of the Laplacian matrix, in contrast to other proposals in terms of the spectrum of the adjacency matrix.

### Node importance for dynamical process on networks: a multiscale characterization.

- Computer ScienceChaos
- 2011

A multiscale node-importance measure that can characterize the importance of the nodes at varying topological scale is proposed by introducing a kernel function whose bandwidth dictates the ranges of interaction, and meanwhile, by taking into account the interactions from all the paths a node is involved.

### Network Evolution Based on Centrality

- Computer Science
- 2010

A sharp transition between hierarchical and homogeneous networks is found, depending on the rate of link decay, and it is shown that this evolution mechanism may lead to double power-law degree distributions, with interrelated exponents.

### Network evolution based on centrality.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2011

A discontinuous transition in the network density between hierarchical and homogeneous networks is found, depending on the rate of link decay, and this evolution mechanism leads to double power-law degree distributions, with interrelated exponents.

### Centrality and Network Analysis: A Perturbative Approach to Dynamical Importance

- Computer Science
- 2011

The main focus will be on the dominant eigenpair of the adjacency matrix representing a graph, as many different centrality measures for networks are cast in terms of eigenvalue problems.

### Approximating spectral impact of structural perturbations in large networks.

- Mathematics, Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2010

A theory for estimating the change of the largest eigenvalue of the adjacency matrix or the extreme eigenvalues of the graph Laplacian when small but arbitrary set of links are added or removed from the network is developed.

### Bounding network spectra for network design

- Mathematics
- 2007

The identification of the limiting factors in the dynamical behaviour of complex systems is an important interdisciplinary problem which often can be traced to the spectral properties of an…

### Interconnecting Networks: The Role of Connector Links

- Computer Science
- 2016

This chapter examines the effects that the particular way in which networks get connected exerts on each of the individual networks and describes how choosing the adequate connector links between networks may promote or hinder different structural and dynamical properties of a particular network.

### Analysis of relative influence of nodes in directed networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2009

The global properties of networks such as hierarchy and position of shortcuts rather than local properties of the nodes, such as the degree, are shown to be the chief determinants of the influence of nodes in many cases.

### Centrality and Network Analysis: A Perturbative Approach to

- Computer Science
- 2011

The main focus will be on the dominant eigenpair of the adjacency matrix representing a graph, as many dierent centrality measures for networks are cast in terms of eigenvalue problems.

## References

SHOWING 1-10 OF 36 REFERENCES

### The Structure and Function of Complex Networks

- Computer ScienceSIAM Rev.
- 2003

Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

### Resilience to damage of graphs with degree correlations.

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2003

This work investigates the problems of site and bond percolation on graphs with degree correlations and their connection with spreading phenomena and obtains some general expressions that allow the computation of the transition thresholds or their bounds.

### Emergence of scaling in random networks

- Computer ScienceScience
- 1999

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

### Statistical mechanics of complex networks

- Computer ScienceArXiv
- 2001

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

### Synchronization in large directed networks of coupled phase oscillators.

- PhysicsChaos
- 2006

This work studies the emergence of collective synchronization in large directed networks of heterogeneous oscillators by generalizing the classical Kuramoto model of globally coupled phase oscillators to more realistic networks and considers the case of networks with mixed positive-negative coupling strengths.

### Generalized percolation in random directed networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2005

We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edges--that is, edges pointing in both directions simultaneously. These…

### Synchronization in networks with random interactions: theory and applications.

- Computer ScienceChaos
- 2006

Some recent results on synchronization in randomly coupled networks and applications to neuroscience, in particular, networks of Hodgkin-Huxley neurons, are included.

### Scale-free topology of e-mail networks.

- Computer Science, Materials SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

The resulting network exhibits a scale-free link distribution and pronounced small-world behavior, as observed in other social networks, implying that the spreading of e-mail viruses is greatly facilitated in real e- mail networks compared to random architectures.

### Onset of synchronization in large networks of coupled oscillators.

- PhysicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2005

The theory of the transition from incoherence to coherence in large networks of coupled phase oscillators is studied and it is found that the theory describes the transition well in situations in which the mean-field approximation fails.