.png){kind=icon}
返回
The heterogeneity in link weights may decrease the robustness of real-world complex weighted networks
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-019-47119-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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(bin)) 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.
Keyword:
ATTACK STRATEGIES
TOLERANCE
ERROR
WEAK
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.0W
被引数:
83.5W
机构
引用论文
.png){kind=icon}
查看更多内容