✦ LIBER ✦

Robustness of networks against cascading failures

✍ Scribed by Bing-Lin Dou; Xue-Guang Wang; Shi-Yong Zhang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 418 KB
Volume: 389
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2010.02.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modeling cascading failures in congested

Modeling cascading failures in congested complex networks

✍ Jian-Feng Zheng; Zi-You Gao; Xiao-Mei Zhao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Cascading failures occur commonly in congested complex networks, where it may be expressed as the process of generation, diffusion and dissipation of congestion. Different from betweeness centrality, we introduce congestion effects to determine the load on the node. In terms of user equilibrium cond

Optimizing complex networks for resilien

Optimizing complex networks for resilience against cascading failure

✍ J. Ash; D. Newth 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 667 KB

Our modern society has come to depend on large-scale infrastructure networks to deliver resources to our homes and businesses in an efficient manner. Over the past 10 years there have been numerous examples where a local disturbance has lead to the global failure of systems. In this paper, we use an

Cascading failures on weighted urban tra

Cascading failures on weighted urban traffic equilibrium networks

✍ J.J. Wu; H.J. Sun; Z.Y. Gao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Effects of the cascading failures on sca

Effects of the cascading failures on scale-free traffic networks

✍ J.J. Wu; Z.Y. Gao; H.J. Sun 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paper, we consider the artificial scale-free traffic network with dynamic weights (cost) and focus on how the removal strategies (flow-based removal, betweenness-based removal and mix-based removal) affect the damage of cascading failures based on the user-equilibrium (UE) assignment, which

Entropy optimization of scale-free netwo

Entropy optimization of scale-free networks’ robustness to random failures

✍ Bing Wang; Huanwen Tang; Chonghui Guo; Zhilong Xiu 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Robust path choice in networks with fail

Robust path choice in networks with failures

✍ Ferris, Michael C.; Ruszczy?ski, Andrzej 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB

The problem of adaptive routing in a network with failures is considered. The network may be in one of finitely many states characterized by different travel times along the arcs, and transitions between the states occur according to a continuous-time Markov chain. The objective was to develop a rou