Construction and Robustness of Interdependent Networks via Time Series and Visibility Graph

Abstract

In this paper, based on time series, visibility graph method and positive correlated coupling, a novel algorithm of constructing interdependent network is proposed. Using this new algorithm, an interdependence network with two subnets (periodic sequence subnet and Conway sequence subnet) is generated. Afterwards, statistical characteristics of this network are analyzed. Finally, with malicious attack, the robustness of the constructed interdependent network is discussed. We find that if the attacked subnet is the periodic subnet, the interdependent network has good robustness when attacking the nodes with larger degrees, and it has poor robustness when attacking the nodes with smaller degrees. If the attacked subnet is Conway sequence subnet, regardless of the attacked nodes with larger or smaller degrees, the network has good robustness.