1
|
Fan J, Zhao D, Xia C, Tanimoto J. Coupled spreading between information and epidemics on multiplex networks with simplicial complexes. CHAOS (WOODBURY, N.Y.) 2022; 32:113115. [PMID: 36456318 DOI: 10.1063/5.0125873] [Citation(s) in RCA: 7] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 09/14/2022] [Accepted: 10/10/2022] [Indexed: 06/17/2023]
Abstract
The way of information diffusion among individuals can be quite complicated, and it is not only limited to one type of communication, but also impacted by multiple channels. Meanwhile, it is easier for an agent to accept an idea once the proportion of their friends who take it goes beyond a specific threshold. Furthermore, in social networks, some higher-order structures, such as simplicial complexes and hypergraph, can describe more abundant and realistic phenomena. Therefore, based on the classical multiplex network model coupling the infectious disease with its relevant information, we propose a novel epidemic model, in which the lower layer represents the physical contact network depicting the epidemic dissemination, while the upper layer stands for the online social network picturing the diffusion of information. In particular, the upper layer is generated by random simplicial complexes, among which the herd-like threshold model is adopted to characterize the information diffusion, and the unaware-aware-unaware model is also considered simultaneously. Using the microscopic Markov chain approach, we analyze the epidemic threshold of the proposed epidemic model and further check the results with numerous Monte Carlo simulations. It is discovered that the threshold model based on the random simplicial complexes network may still cause abrupt transitions on the epidemic threshold. It is also found that simplicial complexes may greatly influence the epidemic size at a steady state.
Collapse
Affiliation(s)
- Junfeng Fan
- Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China
| | - Dawei Zhao
- Shandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan 250014, China
| | - Chengyi Xia
- School of Control Science and Engineering, Tiangong University, Tianjin 300387, China
| | - Jun Tanimoto
- Interdisciplinary Graduate School of Engineering Sciences, Kyushu University, Kasuga-koen, Kasuga-shi, Fukuoka 816-8580, Japan
| |
Collapse
|
2
|
Dong G, Wang N, Wang F, Qing T, Liu Y, Vilela ALM. Network resilience of non-hub nodes failure under memory and non-memory based attacks with limited information. CHAOS (WOODBURY, N.Y.) 2022; 32:063110. [PMID: 35778148 DOI: 10.1063/5.0092284] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 03/22/2022] [Accepted: 05/11/2022] [Indexed: 06/15/2023]
Abstract
Previous studies on network robustness mainly concentrated on hub node failures with fully known network structure information. However, hub nodes are often well protected and not accessible to damage or malfunction in a real-world networked system. In addition, one can only gain insight into limited network connectivity knowledge due to large-scale properties and dynamic changes of the network itself. In particular, two different aggression patterns are present in a network attack: memory based attack, in which failed nodes are not attacked again, or non-memory based attack; that is, nodes can be repeatedly attacked. Inspired by these motivations, we propose an attack pattern with and without memory based on randomly choosing n non-hub nodes with known connectivity information. We use a network system with the Poisson and power-law degree distribution to study the network robustness after applying two failure strategies of non-hub nodes. Additionally, the critical threshold 1 - p and the size of the giant component S are determined for a network configuration model with an arbitrary degree distribution. The results indicate that the system undergoes a continuous second-order phase transition subject to the above attack strategies. We find that 1 - p gradually tends to be stable after increasing rapidly with n. Moreover, the failure of non-hub nodes with a higher degree is more destructive to the network system and makes it more vulnerable. Furthermore, from comparing the attack strategies with and without memory, the results highlight that the system shows better robustness under a non-memory based attack relative to memory based attacks for n > 1. Attacks with memory can block the system's connectivity more efficiently, which has potential applications in real-world systems. Our model sheds light on network resilience under memory and non-memory based attacks with limited information attacks and provides valuable insights into designing robust real-world systems.
Collapse
Affiliation(s)
- Gaogao Dong
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China
| | - Nan Wang
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China
| | - Fan Wang
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China
| | - Ting Qing
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, Jiangsu, China
| | - Yangyang Liu
- Academy of Military Science, Beijing 100097, China
| | - André L M Vilela
- Física de Materiais, Universidade de Pernambuco, Recife, Pernambuco 50100-010, Brazil
| |
Collapse
|
3
|
Hao Y, Jia L, Wang Y, He Z. Improving robustness in interdependent networks under intentional attacks by optimizing intra-link allocation. CHAOS (WOODBURY, N.Y.) 2021; 31:093133. [PMID: 34598464 DOI: 10.1063/5.0054070] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 04/14/2021] [Accepted: 09/02/2021] [Indexed: 06/13/2023]
Abstract
The interdependent network is particularly vulnerable to attacks on high degree nodes; therefore, the improvement of its robustness under intentional attacks has become an important topic. In this paper, we put forward a new metric to quantify the robustness of interdependent networks against intentional attacks and develop an improved simulated annealing algorithm (ISAA) to maximize this metric by optimizing the allocation of intra-links in subnetworks. Based on the comparison between the ISAA and existing algorithms, it is found that the algorithm presented in this paper is more effective to enhance the robustness of an interdependent scale-free network (ISFN). By applying the ISAA to ISFNs with different coupling preferences, there is a key finding that the robustness of the optimized ISFN is significantly stronger than that of the original ISFN. In particular, for cases of disassortative and random couplings, no sudden collapse occurs in optimized ISFNs. According to the analysis of the degree and the clustering coefficient, we find that the subnetwork of the optimized ISFN exhibits an onion-like structure. In addition, the ISFN whose robustness is enhanced to resist the attacks on high degree nodes is still robust to the intentional attacks concerning the betweenness and PageRank.
Collapse
Affiliation(s)
- Yucheng Hao
- State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, No. 3 Shangyuancun Haidian District, Beijing 100044, China
| | - Limin Jia
- State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, No. 3 Shangyuancun Haidian District, Beijing 100044, China
| | - Yanhui Wang
- State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, No. 3 Shangyuancun Haidian District, Beijing 100044, China
| | - Zhichao He
- State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, No. 3 Shangyuancun Haidian District, Beijing 100044, China
| |
Collapse
|
4
|
Zhao D, Liu C, Peng H, Yu J, Han J. A Security Scheme Based on Intranal-Adding Links for Integrated Industrial Cyber-Physical Systems. SENSORS 2021; 21:s21082794. [PMID: 33921091 PMCID: PMC8071418 DOI: 10.3390/s21082794] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/28/2021] [Revised: 04/12/2021] [Accepted: 04/13/2021] [Indexed: 11/16/2022]
Abstract
With the advent of the Internet of Everything era, the Industrial Internet is increasingly showing mutual integration and development. Its core framework, the industrial CPS (Cyber-Physical Systems), has received more and more attention and in-depth research in recent years. These complex industrial CPS systems are usually composed of multiple interdependent sub-networks (such as physical networks and control networks, etc.). Minor faults or failure behaviors between sub-networks may cause serious cascading failure effects of the entire system. In this paper, we will propose a security scheme based on intranal-adding links in the face of the integrated and converged industrial CPS system environment. Firstly, by calculating the size of the largest connected component in the entire system, we can compare and analyze industrial CPS systems’ security performance under random attacks. Secondly, we compare and analyze the risk of cascading failure between integrated industrial CPS systems under different intranal-adding link strategies. Finally, the simulation results verify the system security strategy’s effectiveness under different strategies and show a relatively better exchange strategy to enhance the system’s security. In addition, this paper’s research work can help us design how to further optimize the interdependent industrial CPS system’s topology to cope with the integrated and converged industrial CPS system environment.
Collapse
|
5
|
Dong G, Yao Q, Wang F, Du R, Vilela ALM, Eugene Stanley H. Percolation on coupled networks with multiple effective dependency links. CHAOS (WOODBURY, N.Y.) 2021; 31:033152. [PMID: 33810758 DOI: 10.1063/5.0046564] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/04/2021] [Accepted: 03/08/2021] [Indexed: 06/12/2023]
Abstract
The ubiquitous coupled relationship between network systems has become an essential paradigm to depict complex systems. A remarkable property in the coupled complex systems is that a functional node should have multiple external support associations in addition to maintaining the connectivity of the local network. In this paper, we develop a theoretical framework to study the structural robustness of the coupled network with multiple useful dependency links. It is defined that a functional node has the broadest connectivity within the internal network and requires at least M support link of the other network to function. In this model, we present exact analytical expressions for the process of cascading failures, the fraction of functional nodes in the stable state, and provide a calculation method of the critical threshold. The results indicate that the system undergoes an abrupt phase transition behavior after initial failure. Moreover, the minimum inner and inter-connectivity density to maintain system survival is graphically presented at different multiple effective dependency links. Furthermore, we find that the system needs more internal connection densities to avoid collapse when it requires more effective support links. These findings allow us to reveal the details of a more realistic coupled complex system and develop efficient approaches for designing resilient infrastructure.
Collapse
Affiliation(s)
- Gaogao Dong
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013 Jiangsu, China
| | - Qunying Yao
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013 Jiangsu, China
| | - Fan Wang
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013 Jiangsu, China
| | - Ruijin Du
- School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013 Jiangsu, China
| | - André L M Vilela
- Física de Materiais, Universidade de Pernambuco, Recife, Pernambuco 50720-001, Brazil
| | - H Eugene Stanley
- Center for Polymer Studies and Department of Physics, Boston University, Boston, Massachusetts 02115, USA
| |
Collapse
|
6
|
Peng H, Liu C, Zhao D, Hu Z, Han J. Security Evaluation under Different Exchange Strategies Based on Heterogeneous CPS Model in Interdependent Sensor Networks. SENSORS (BASEL, SWITZERLAND) 2020; 20:E6123. [PMID: 33126431 PMCID: PMC7662949 DOI: 10.3390/s20216123] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/13/2020] [Revised: 10/19/2020] [Accepted: 10/22/2020] [Indexed: 11/24/2022]
Abstract
In the real Internet of Everything scenario, many large-scale information systems can be converted into interdependent sensor networks, such as smart grids, smart medical systems, and industrial Internet systems. These complex systems usually have multiple interdependent sensor networks. Small faults or failure behaviors between networks may cause serious cascading failure effects of the entire system. Therefore, in this paper, we will focus on the security of interdependent sensor networks. Firstly, by calculating the size of the largest functional component in the entire network, the impact of random attacks on the security of interdependent sensor networks is analyzed. Secondly, it compares and analyzes the impact of cascading failures between interdependent sensor networks under different switching edge strategies. Finally, the simulation results verify the effect of the security of the system under different strategies, and give a better exchange strategy to enhance the security of the system. In addition, the research work in this article can help design how to further optimize the topology of interdependent sensor networks by reducing the impact of cascading failures.
Collapse
Affiliation(s)
| | | | - Dandan Zhao
- College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua 321004, China; (H.P.); (C.L.); (Z.H.); (J.H.)
| | | | | |
Collapse
|
7
|
Jiang J, Xia Y, Xu S, Shen HL, Wu J. An asymmetric interdependent networks model for cyber-physical systems. CHAOS (WOODBURY, N.Y.) 2020; 30:053135. [PMID: 32491887 DOI: 10.1063/1.5139254] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/19/2019] [Accepted: 05/01/2020] [Indexed: 06/11/2023]
Abstract
Cyber-physical systems (CPSs) are integrations of information technology and physical systems, which are more and more significant in society. As a typical example of CPSs, smart grids integrate many advanced devices and information technologies to form a safer and more efficient power system. However, interconnection with the cyber network makes the system more complex, so that the robustness assessment of CPSs becomes more difficult. This paper proposes a new CPS model from a complex network perspective. We try to consider the real dynamics of cyber and physical parts and the asymmetric interdependency between them. Simulation results show that coupling with the communication network makes better robustness of power system. But since the influences between the power and communication networks are asymmetric, the system parameters play an important role to determine the robustness of the whole system.
Collapse
Affiliation(s)
- Jiang Jiang
- College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China
| | - Yongxiang Xia
- School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
| | - Sheng Xu
- College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China
| | - Hui-Liang Shen
- College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China
| | - Jiajing Wu
- School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China
| |
Collapse
|
8
|
Xia Y, Small M, Wu J. Introduction to Focus Issue: Complex Network Approaches to Cyber-Physical Systems. CHAOS (WOODBURY, N.Y.) 2019; 29:093123. [PMID: 31575131 DOI: 10.1063/1.5126230] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Received: 08/30/2019] [Accepted: 09/04/2019] [Indexed: 06/10/2023]
Affiliation(s)
- Yongxiang Xia
- School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
| | - Michael Small
- Complex Systems Group, Department of Mathematics and Statistics, The University of Western Australia, Crawley, Western Australia 6009, Australia
| | - Jiajing Wu
- School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510275, China
| |
Collapse
|