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.

Graphic abstract

中文翻译：

---

拆除大型多路复用网络的有效层节点攻击策略

摘要

网络拆除的目的是确定最小的节点集，这些节点的拆除会将网络分解为亚扩展大小的组件。该问题的解决方案对于设计免疫策略，信息传播和网络攻击的最佳策略具有重要意义。可以将由通过多种类型的链接连接的节点组成的现代系统（例如社交网络和关键基础结构网络）封装到多路复用网络的框架中。在此，我们重点研究基于层节点攻击的复用网络中的拆卸问题，并提出一种基于网络回收的高效拆卸算法。在合成网络和现实世界网络上进行的实验表明，该算法比现有算法有明显的优势。我们还展示了层间关联度如何影响多路复用网络的鲁棒性。我们的结果为设计更具弹性的网络系统以及有效破坏有害网络提供了启示。

图形摘要