Abstract
This paper is motivated by the following two related problems in complex networks: (i) control of cascading failures and (ii) mitigation of traffic congestion. Both problems are of significant recent interest as they address, respectively, the security of and efficient information transmission on complex networks. Taking into account typical features of load distribution and weights in real-world networks, we have discovered an optimal solution to both problems. In particular, we shall provide numerical evidence and theoretical analysis that, by choosing a proper weighting parameter, a maximum level of robustness against cascades and traffic congestion can be achieved, which practically rids the network of occurrences of the catastrophic dynamics. © 2009 The American Physical Society.
| Original language | English |
|---|---|
| Article number | 26112 |
| Journal | Physical Review E - Statistical, Nonlinear, and Soft Matter Physics |
| Volume | 79 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2 Feb 2009 |
Publisher's Copyright Statement
- COPYRIGHT TERMS OF DEPOSITED FINAL PUBLISHED VERSION FILE: Yang, R., Wang, W-X., Lai, Y-C., & Chen, G. (2009). Optimal weighting scheme for suppressing cascades and traffic congestion in complex networks. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 79(2), [26112]. https://doi.org/10.1103/PhysRevE.79.026112. The copyright of this article is owned by American Physical Society.