Construction And Robustness Of Interdependent Networks Via Time Series And Visibility Graph

2ND INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND OPTIMIZATION TECHNOLOGIES AND APPLICATIONS (MSOTA 2018)(2018)

引用 0|浏览2
暂无评分
摘要
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.
更多
查看译文
关键词
Interdependent networks, Time series, Visibility graph, Robustness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要