The effect of randomness for dependency map on the robustness of interdependent lattices

Jing Yuan, Lixiang Li, Haipeng Peng, Jürgen Kurths, Jinghua Xiao, Yixian Yang

Research output: Contribution to journal › Article

6 Citations (Scopus)
5 Downloads (Pure)

Abstract

The percolation for interdependent networks with identical dependency map follows a secondorder phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the influence of randomness for dependency maps on the robustness of interdependent lattice networks. We introduce approximate entropy(ApEn) as the measure of randomness of the dependency maps. We find that there is critical ApEnc below which the percolation is continuous, but for larger ApEn, it is a first-order transition. With the increment of ApEn, the pc increases until ApEn reaching ApEn0 c and then remains almost constant. The time scale of the system shows rich properties as ApEn increases. Our results uncover that randomness is one of the important factors that lead to cascading failures of spatially interdependent networks. VC 2016 AIP Publishing LLC.
Original languageEnglish
Article number013105
Pages (from-to)1-8
Number of pages8
JournalChaos
Volume26
Issue number1
Early online date19 Jan 2016
DOIs
Publication statusPublished - Jan 2016

Fingerprint

Approximate Entropy
Randomness
Entropy
Robustness
entropy
Cascading Failure
First-order Phase Transition
Phase transitions
Increment
Time Scales
First-order

Cite this

Yuan, J., Li, L., Peng, H., Kurths, J., Xiao, J., & Yang, Y. (2016). The effect of randomness for dependency map on the robustness of interdependent lattices. Chaos, 26(1), 1-8. [013105]. https://doi.org/10.1063/1.4939984

The effect of randomness for dependency map on the robustness of interdependent lattices. / Yuan, Jing; Li, Lixiang; Peng, Haipeng; Kurths, Jürgen; Xiao, Jinghua; Yang, Yixian.

In: Chaos, Vol. 26, No. 1, 013105, 01.2016, p. 1-8.

Research output: Contribution to journal › Article

Yuan, J, Li, L, Peng, H, Kurths, J, Xiao, J & Yang, Y 2016, 'The effect of randomness for dependency map on the robustness of interdependent lattices', Chaos, vol. 26, no. 1, 013105, pp. 1-8. https://doi.org/10.1063/1.4939984
Yuan J, Li L, Peng H, Kurths J, Xiao J, Yang Y. The effect of randomness for dependency map on the robustness of interdependent lattices. Chaos. 2016 Jan;26(1):1-8. 013105. https://doi.org/10.1063/1.4939984
Yuan, Jing ; Li, Lixiang ; Peng, Haipeng ; Kurths, Jürgen ; Xiao, Jinghua ; Yang, Yixian. / The effect of randomness for dependency map on the robustness of interdependent lattices. In: Chaos. 2016 ; Vol. 26, No. 1. pp. 1-8.
@article{7e3e5f454bca48869f48177aa7c246dd,
title = "The effect of randomness for dependency map on the robustness of interdependent lattices",
abstract = "The percolation for interdependent networks with identical dependency map follows a secondorder phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the influence of randomness for dependency maps on the robustness of interdependent lattice networks. We introduce approximate entropy(ApEn) as the measure of randomness of the dependency maps. We find that there is critical ApEnc below which the percolation is continuous, but for larger ApEn, it is a first-order transition. With the increment of ApEn, the pc increases until ApEn reaching ApEn0 c and then remains almost constant. The time scale of the system shows rich properties as ApEn increases. Our results uncover that randomness is one of the important factors that lead to cascading failures of spatially interdependent networks. VC 2016 AIP Publishing LLC.",
author = "Jing Yuan and Lixiang Li and Haipeng Peng and J{\"u}rgen Kurths and Jinghua Xiao and Yixian Yang",
note = "ACKNOWLEDGMENTS This paper is supported by the National Natural Science Foundation of China (Grant Nos. 61573067 and 61472045), the Beijing Higher Education Young Elite Teacher Project (Grant No. YETP0449), the Asia Foresight Program under NSFC Grant (Grant No. 61411146001), and the Beijing Natural Science Foundation (Grant No. 4142016).",
year = "2016",
month = "1",
doi = "10.1063/1.4939984",
language = "English",
volume = "26",
pages = "1--8",
journal = "Chaos",
issn = "1054-1500",
publisher = "American Institute of Physics",
number = "1",

}

TY - JOUR

T1 - The effect of randomness for dependency map on the robustness of interdependent lattices

AU - Yuan, Jing

AU - Li, Lixiang

AU - Peng, Haipeng

AU - Kurths, Jürgen

AU - Xiao, Jinghua

AU - Yang, Yixian

N1 - ACKNOWLEDGMENTS This paper is supported by the National Natural Science Foundation of China (Grant Nos. 61573067 and 61472045), the Beijing Higher Education Young Elite Teacher Project (Grant No. YETP0449), the Asia Foresight Program under NSFC Grant (Grant No. 61411146001), and the Beijing Natural Science Foundation (Grant No. 4142016).

PY - 2016/1

Y1 - 2016/1

N2 - The percolation for interdependent networks with identical dependency map follows a secondorder phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the influence of randomness for dependency maps on the robustness of interdependent lattice networks. We introduce approximate entropy(ApEn) as the measure of randomness of the dependency maps. We find that there is critical ApEnc below which the percolation is continuous, but for larger ApEn, it is a first-order transition. With the increment of ApEn, the pc increases until ApEn reaching ApEn0 c and then remains almost constant. The time scale of the system shows rich properties as ApEn increases. Our results uncover that randomness is one of the important factors that lead to cascading failures of spatially interdependent networks. VC 2016 AIP Publishing LLC.

AB - The percolation for interdependent networks with identical dependency map follows a secondorder phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the influence of randomness for dependency maps on the robustness of interdependent lattice networks. We introduce approximate entropy(ApEn) as the measure of randomness of the dependency maps. We find that there is critical ApEnc below which the percolation is continuous, but for larger ApEn, it is a first-order transition. With the increment of ApEn, the pc increases until ApEn reaching ApEn0 c and then remains almost constant. The time scale of the system shows rich properties as ApEn increases. Our results uncover that randomness is one of the important factors that lead to cascading failures of spatially interdependent networks. VC 2016 AIP Publishing LLC.

U2 - 10.1063/1.4939984

DO - 10.1063/1.4939984

M3 - Article

VL - 26

SP - 1

EP - 8

JO - Chaos

JF - Chaos

SN - 1054-1500

IS - 1

M1 - 013105

ER -

Access to Document