Oscillations of complex networks
arXiv:cond-mat/0607351 · doi:10.1103/PhysRevE.74.066104
Abstract
A complex network processing information or physical flows is usually characterized by a number of macroscopic quantities such as the diameter and the betweenness centrality. An issue of significant theoretical and practical interest is how such a network responds to sudden changes caused by attacks or disturbances. By introducing a model to address this issue, we find that, for a finite-capacity network, perturbations can cause the network to \emph{oscillate} persistently in the sense that the characterizing quantities vary periodically or randomly with time. We provide a theoretical estimate of the critical capacity-parameter value for the onset of the network oscillation. The finding is expected to have broad implications as it suggests that complex networks may be structurally highly dynamic.
4 pages, 4 figures. submitted
References in corpus (17)
- Emergence of scaling in random networks
- Error and attack tolerance of complex networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Mean-field theory for scale-free random networks
- Cascade-based attacks on complex networks
- Breakdown of the Internet under intentional attack
- Universal Behavior of Load Distribution in Scale-free Networks
- Cascade control and defense in complex networks
- Instability of scale-free networks under node-breaking avalanches
- Vertex overload breakdown in evolving networks
- Edge overload breakdown in evolving networks
- Critical load and congestion instabilities in scale-free networks
- Separating internal and external dynamics of complex systems
- Comment on: 'Universal Behavior of Load Distribution in Scale-free Networks'
- Reply to "Comment on 'Universal Behavior of Load Distribution in Scale-Free Networks'"