Abstract
Enhancing the robustness of complex networks is of great practical significance as it ensures the stable operation of infrastructure systems. We measure its robustness by examining the size of the largest connected component of the network after initial attacks. However, traditional research on network robustness enhancement has mainly focused on low-order networks, with little attention given to higher-order networks, particularly higher-low order coupling networks(the largest connected component of the network must exist in both higher-order and low-order networks). To address this issue, this paper proposes robust optimization methods for higher-low order coupled networks based on the greedy algorithm and the simulated annealing algorithm. By comparison, we found that the simulated annealing algorithm performs better. The proposed method optimizes the topology of the low-order network and the higher-order network by randomly reconnecting the edges, thereby enhancing the robustness of the higher-order and low-order coupled network. The experiments were conducted on multiple real networks to evaluate the change in the robustness coefficient before and after network optimization. The results demonstrate that the proposed method can effectively improve the robustness of both low-order and higher-order networks, ultimately enhancing the robustness of higher-low order coupled networks.
Funder
National Natural Science Foundation of China
National Science Foundation of Jiangsu Province of China
Major national social science project
Publisher
Public Library of Science (PLoS)
Reference51 articles.
1. High-performance simulation of low-resolution network flows;DM Nicol;Simulation,2006
2. Involvement in internet aggression during early adolescence;NE Werner;Journal of youth and adolescence,2010
3. Effects of the information-driven awareness on epidemic spreading on multiplex networks;J Wang;Chaos: An Interdisciplinary Journal of Nonlinear Science,2022
4. Robustness evaluation of multipartite complex networks based on percolation theory;Q Cai;IEEE Transactions on Systems, Man, and Cybernetics: Systems,2020
5. Erdős P, Rényi A. On random graphs I. Publicationes Mathematicae (Debrecen); 1959.