论文标题
探索基于社区的拆除策略的景观
Exploring the landscape of community-based dismantling strategies
论文作者
论文摘要
网络拆卸是网络科学领域的一个相关研究领域，从理论和运营的角度引起了人们的关注。在这里，我们提出了一个拆除的一般框架，该框架优先考虑将不同网络社区桥接在一起的节点。我们检测到的策略并非唯一，因为它们取决于所考虑的社区检测算法的具体实现。但是，当将方法应用于某些现实世界网络时，我们发现拆卸发生的渗透阈值是强大的，并且不取决于特定的算法。因此，许多社区检测算法中本质上存在的随机性允许确定几种具有可比性但需要去除不同节点的策略。此功能在操作环境中高度相关，在操作环境中，删除节点的成本很高，并允许确定最便宜的策略仍然具有很高的有效性。
Network dismantling is a relevant research area in network science, gathering attention both from a theoretical and an operational point of view. Here, we propose a general framework for dismantling that prioritizes the removal of nodes that bridge together different network communities. The strategies we detect are not unique, as they depend on the specific realization of the community detection algorithm considered. However, when applying the methodology to some real-world networks we find that the percolation threshold at which dismantling occurs is strongly robust, and it does not depend on the specific algorithm. Thus, the stochasticity inherently present in many community detection algorithms allows to identify several strategies that have comparable effectiveness but require the removal of distinct subsets of nodes. This feature is highly relevant in operational contexts in which the removal of nodes is costly and allows to identify the least expensive strategy that still holds high effectiveness.
