Structural instability of large-scale functional networks

Abstract

We study how large functional networks can grow stably under possible cascading overload failures and evaluated the maximum stable network size above which even a small-scale failure would cause a fatal breakdown of the network. Employing a model of cascading failures induced by temporally fluctuating loads, the maximum stable size $n_{\text{max}}$ has been calculated as a function of the load reduction parameter $r$ that characterizes how quickly the total load is reduced during the cascade. If we reduce the total load sufficiently fast ($r\ge r_{\text{c}}$), the network can grow infinitely. Otherwise, $n_{\text{max}}$ is finite and increases with $r$. For a fixed $r(<r_{\text{c}})$, $n_{\text{max}}$ for a scale-free network is larger than that for an exponential network with the same average degree. We also discuss how one detects and avoids the crisis of a fatal breakdown of the network from the relation between the sizes of the initial network and the largest component after an ordinarily occurring cascading failure.

6 pages, 3 figures

References in corpus (11)

• Critical phenomena in complex networks
• Robustness of a Network of Networks
• Assortativity Decreases the Robustness of Interdependent Networks
• Percolation on correlated networks
• Robustness of onion-like correlated networks against targeted attacks
• Scaling breakdown in flow fluctuations on complex networks
• Extreme events on complex networks
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Critical behavior and correlations on scale-free small-world networks. Application to network design
• Fractal and Small-World Networks Formed by Self-Organized Critical Dynamics
• Random Walks on Complex Networks

Cited by in corpus (1)

• Simple model of fractal networks formed by self-organized critical dynamics