Dipartimento di Scienze Matematiche, Fisiche e Informatiche, Università di Parma, via G.P. Usberti, 7/a, 43124, Parma, Italy.
PSH, UR 1115, INRA, 84000, Avignon, France.
Sci Rep. 2019 Jul 23;9(1):10692. doi: 10.1038/s41598-019-47119-2.
Here we report a comprehensive analysis of the robustness of seven high-quality real-world complex weighted networks to errors and attacks toward nodes and links. We use measures of the network damage conceived for a binary (e.g. largest connected cluster LCC, and binary efficiency Eff) or a weighted network structure (e.g. the efficiency Eff, and the total flow TF). We find that removing a very small fraction of nodes and links with respectively higher strength and weight triggers an abrupt collapse of the weighted functioning measures while measures that evaluate the binary-topological connectedness are almost unaffected. These findings unveil a problematic response-state where the attack toward a small fraction of nodes-links returns the real-world complex networks in a connected but inefficient state. Our findings unveil how the robustness may be overestimated when focusing on the connectedness of the components only. Last, to understand how the networks robustness is affected by link weights heterogeneity, we randomly assign link weights over the topological structure of the real-world networks and we find that highly heterogeneous networks show a faster efficiency decrease under nodes-links removal: i.e. the robustness of the real-world complex networks against nodes-links removal is negatively correlated with link weights heterogeneity.
在这里,我们报告了对七个高质量真实复杂加权网络在节点和链路错误和攻击方面的稳健性进行全面分析。我们使用针对二进制网络(例如最大连通簇 LCC 和二进制效率 Eff)或加权网络结构(例如效率 Eff 和总流量 TF)设计的网络损坏度量。我们发现,去除具有较高强度和权重的一小部分节点和链路会引发加权功能度量的突然崩溃,而评估二进制拓扑连通性的度量几乎不受影响。这些发现揭示了一种有问题的响应状态,即对一小部分节点-链路的攻击会使真实复杂网络处于连通但低效的状态。我们的发现揭示了当仅关注组件的连通性时,稳健性可能会被高估。最后,为了了解网络稳健性如何受到链路权重异质性的影响,我们在真实网络的拓扑结构上随机分配链路权重,并且发现高度异质的网络在节点-链路删除下表现出更快的效率下降:即真实复杂网络对节点-链路删除的稳健性与链路权重异质性呈负相关。