论文标题
真正的复杂加权网络的新节点攻击策略
New nodes attack strategies for real complex weighted networks
论文作者
论文摘要
在这项工作中，我们引入了一种新的节点攻击策略，以消除有条件加权中心（CONDWBET）的节点。我们将其功效与五个现实世界中复杂加权网络的文献中的众所周知的攻击策略进行了比较。我们使用网络加权效率（WEFF），例如一个措施，除了常用的二进制二进制措施（最大的连接群集（LCC））外，还涵盖了网络的加权结构。我们发现，最近提出的条件性与内度策略（Condbet）（Nguyen等人，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
