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 language | English |
---|---|
Article number | 013105 |
Pages (from-to) | 1-8 |
Number of pages | 8 |
Journal | Chaos |
Volume | 26 |
Issue number | 1 |
Early online date | 19 Jan 2016 |
DOIs | |
Publication status | Published - Jan 2016 |