.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
ATTACK STRATEGIES
TOLERANCE
ERROR
WEAK
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
28.0W
Citations:
83.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more