arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.02655cs.SIphysics.soc-ph
收藏

通过目标枚举实现经济高效的网络分解

Cost-effective Network Disintegration through Targeted Enumeration

Zhigang Wang, Ye Deng, Petter Holme, Zengru Di, Linyuan Lv, Jun Wu

摘要:

寻找一个最优的节点或链接子集来瓦解有害网络是网络科学中的一个基本问题,在反恐、流行病控制和许多其他研究领域都有潜在的应用。网络解体问题的挑战是平衡战略的有效性和效率。在本文中,我们提出了一个成本有效的有针对性的枚举方法的网络解体。该方法包括两个阶段:搜索候选对象和确定最优解。在第一阶段中,我们使用等级聚合来生成节点重要性的综合排名,在此基础上,我们确定了一个小规模的候选节点集来删除。在第二阶段,我们使用枚举方法来找到候选节点之间的最佳组合。在合成网络和真实网络上的大量实验结果表明,该方法在有效性和效率之间取得了令人满意的折衷。引入的两阶段有针对性的枚举框架也可以应用于其他计算上难以处理的组合优化问题,从团队组装通过投资组合到药物设计。

英文摘要:

Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications to anti-terrorism, epidemic control, and many other fields of study. The challenge of the network disintegration problem is to balance the effectiveness and efficiency of strategies. In this paper, we propose a cost-effective targeted enumeration method for network disintegration. The proposed approach includes two stages: searching for candidate objects and identifying an optimal solution. In the first stage, we use rank aggregation to generate a comprehensive ranking of node importance, upon which we identify a small-scale candidate set of nodes to remove. In the second stage, we use an enumeration method to find an optimal combination among the candidate nodes. Extensive experimental results on synthetic and real-world networks demonstrate that the proposed method achieves a satisfying trade-off between effectiveness and efficiency. The introduced two-stage targeted enumeration framework can also be applied to other computationally intractable combinational optimization problems, from team assembly via portfolio investment to drug design.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑