Abstract
Recently, the robustness of interconnected networks has attracted extensive attentions, one of which is to investigate the influence of coupling preference. In this paper, the memetic algorithm (MA) is employed to optimize the coupling links of interconnected networks. Afterwards, a comparison is made between MA optimized coupling strategy and traditional assortative, disassortative and random coupling preferences. It is found that the MA optimized coupling strategy with a moderate assortative value shows an outstanding performance against cascading failures on both synthetic scale-free interconnected networks and real-world networks. We then provide an explanation for this phenomenon from a micro-scope point of view and propose a coupling coefficient index to quantify the coupling preference. Our work is helpful for the design of robust interconnected networks.
| Original language | English |
|---|---|
| Pages (from-to) | 123-129 |
| Number of pages | 7 |
| Journal | Chaos, Solitons and Fractals |
| Volume | 92 |
| DOIs | |
| State | Published - 1 Nov 2016 |
Keywords
- Coupling preference
- Interconnected networks
- Memetic algorithms
- Robustness
Fingerprint
Dive into the research topics of 'Cascade-robustness optimization of coupling preference in interconnected networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver