实复杂加权网络的新节点攻击策略
New nodes attack strategies for real complex weighted networks
摘要：
在这项工作中，我们介绍了一种新的节点攻击策略，删除节点的最高条件加权介数中心（CondWBet）。我们比较了它的功效与著名的攻击策略，从文献中超过五个现实世界的复杂加权网络。我们使用网络加权效率（WEFF）作为衡量网络加权结构的一个指标，除了常用的二进制拓扑度量，最大连通簇（LCC）。我们发现，最近提出的条件介数策略（CondBet）（Nguyen et al. 2019）在所有情况下都是分割LCC的最佳方法。此外，我们发现，在5种情况下的3种情况下，引入的CondWBet策略是降低网络效率（WEFF）的最佳策略。最后，CondWBet是在移除过程开始时减少WEFF的最有效策略，而首先移除具有最高链接权重的节点的强度在移除过程的最后阶段当网络在许多小集群中被破坏时显示出最高的功效。这些最后的结果表明，一个更好的攻击策略可能是CondWBet和强度策略的组合
英文摘要：
In this work we introduce a new nodes attack strategy removing nodes with highest conditional weighted betweenness centrality (CondWBet). We compare its efficacy with well-known attack strategies from literature over five real-world complex weighted networks. We use the network weighted efficiency (WEFF) like a measure encompassing the weighted structure of the network in addition to the commonly used binary-topological measure, the largest connected cluster (LCC). We find that the recently proposed conditional betweenness strategy (CondBet) (Nguyen et al. 2019) is the best to fragment the LCC in all cases. Further, we find that the introduced CondWBet strategy is the best to decrease the network efficiency (WEFF) in 3 out of 5 cases. Last, CondWBet is be the most effective strategy to reduce WEFF at the beginning of the removal process whereas the Strength that removes nodes with highest link weights first, shows the highest efficacy in the final phase of the removal process when the network is broken in many small clusters. These last outcomes would suggest that a better attacking strategy could be a combination of the CondWBet and Strength strategies
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
