An efficient layer node attack strategy to dismantle large multiplex networks

Abstract

Network dismantling aims to identify the minimum set of nodes whose removal breaks the network into components of sub-extensive size. The solution to this problem is significant for designing optimal strategies for immunization policies, information spreading, and network attack. Modern systems, such as social networks and critical infrastructure networks, which consist of nodes connected by links of multiple types can be encapsulated into the framework of multiplex networks. Here we focus on the dismantling problem in multiplex networks under layer node-based attack, and propose an efficient dismantling algorithm based on network decycling. Experiments on synthetic and real-world networks show that the proposed algorithm outperforms existing algorithms by a considerable margin. We also show how the robustness of a multiplex network is affected by the interlayer degree correlation. Our results shed light on the design of more resilient network systems and the effective destruction of harmful networks.