{"title":"Cascading Failures in Interdependent Networks with Reinforced Crucial Nodes and Dependency Groups","authors":"Qian Li, Hongtao Yu, Shaomei Li, Shuxin Liu","doi":"10.1142/s0129183124500554","DOIUrl":null,"url":null,"abstract":"Previous studies of group percolation models in interdependent networks with reinforced nodes have rarely addressed the effects of the degree of reinforced nodes and the heterogeneity of group size distribution. In this paper, a cascading failure model in interdependent networks with reinforced crucial nodes and dependency groups is investigated numerically and analytically. For each group, we assume that if all the nodes in a group fail on one network, a node on another network that depends on that group will fail. We find that rich percolation transitions can be classified into three types: discontinuous, continuous, and hybrid phase transitions, which depend on the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Importantly, our proposed crucial reinforced method has higher reinforcement efficiency than the random reinforced method. More significantly, we develop a general theoretical framework to calculate the percolation transition points and the shift point of percolation types. Simulation results show that the robustness of interdependent networks can be improved by increasing the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Our theoretical results can well agree with numerical simulations. These findings might develop a new perspective for designing more resilient interdependent infrastructure networks.","PeriodicalId":50308,"journal":{"name":"International Journal of Modern Physics C","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Modern Physics C","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129183124500554","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Previous studies of group percolation models in interdependent networks with reinforced nodes have rarely addressed the effects of the degree of reinforced nodes and the heterogeneity of group size distribution. In this paper, a cascading failure model in interdependent networks with reinforced crucial nodes and dependency groups is investigated numerically and analytically. For each group, we assume that if all the nodes in a group fail on one network, a node on another network that depends on that group will fail. We find that rich percolation transitions can be classified into three types: discontinuous, continuous, and hybrid phase transitions, which depend on the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Importantly, our proposed crucial reinforced method has higher reinforcement efficiency than the random reinforced method. More significantly, we develop a general theoretical framework to calculate the percolation transition points and the shift point of percolation types. Simulation results show that the robustness of interdependent networks can be improved by increasing the density of reinforced crucial nodes, the group size, and the heterogeneity of group size distribution. Our theoretical results can well agree with numerical simulations. These findings might develop a new perspective for designing more resilient interdependent infrastructure networks.
期刊介绍:
International Journal of Modern Physics C (IJMPC) is a journal dedicated to Computational Physics and aims at publishing both review and research articles on the use of computers to advance knowledge in physical sciences and the use of physical analogies in computation. Topics covered include: algorithms; computational biophysics; computational fluid dynamics; statistical physics; complex systems; computer and information science; condensed matter physics, materials science; socio- and econophysics; data analysis and computation in experimental physics; environmental physics; traffic modelling; physical computation including neural nets, cellular automata and genetic algorithms.