Improving the network robustness against cascading failures by adding links

Xian-Bin Cao, Chen Hong, Wen-Bo Du and Jun Zhang

Chaos, Solitons & Fractals, 2013, vol. 57, issue C, 35-40

Abstract: In this paper, we explore the network robustness against cascading failures by adding links to the underlying network structure. Three link-adding strategies are compared, including random linking strategy (RLS), high-betweenness linking strategy (HBS), and low-polarization linking strategy (LPS). It is found that HBS is more effective than RLS to enhance the network robustness against cascades while the network exhibits the strongest robustness under LPS. Moreover, the effect of the total cost of link-adding is investigated. As the total cost grows, the advantage of LPS becomes more evident. Our work would be helpful for the design of networked systems.

Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077913001604
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:57:y:2013:i:c:p:35-40

DOI: 10.1016/j.chaos.2013.08.007

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().