Synchronization in Scale-free Dynamical Networks: Robustness and Fragility
arXiv:cond-mat/0105014
Abstract
Recently, it has been demonstrated that many large complex networks display a scale-free feature, that is, their connectivity distributions have the power-law form. In this paper, we investigate the synchronization phenomena in a scale-free dynamical network. We show that its synchronizability is robust against random removal of nodes, but is fragile to specific removal of the most highly connected nodes.
19 pages, 4 figures
References in corpus (6)
- Emergence of scaling in random networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Mean-field theory for scale-free random networks
- How Popular is Your Paper? An Empirical Study of the Citation Distribution
- Highly Optimized Tolerance: Robustness and Power Laws in Complex Systems