Reliability analysis of interdependent hypergraph network under different attack strategies

Nodes usually cooperate to form groups and survive or fail in real-world systems. Researchers typically consider the interdependence between node groups in studying the interdependent network. This paper studies the robustness of interdependent hypergraph networks under different attack strategies. According to the characteristics of the network model, we propose a series of target attack strategies and compare the destructive effect of these strategies on the network. Second, we analyze the impact of the random edge removal strategy on the robustness of hypergraph networks under different edge removal ratios. Finally, we propose four target-node edge removal strategies and compare their destructive effects on the network at the same edge removal ratios. Simulation results show that target attack and edge removal strategies can appreciably reduce the robustness of interdependent hypergraph networks and accelerate the networks' collapse.

Automated summary

This paper studies the robustness of interdependent hypergraph networks under different attack strategies and proposes a series of target attack strategies. The research results show that these attack strategies can significantly reduce the network's robustness and lead to network collapse.