Journal
MATHEMATICS
Volume 11, Issue 16, Pages -Publisher
MDPI
DOI: 10.3390/math11163482
Keywords
complex network; robustness; weight thresholding; node attack strategies; weak link removal
Categories
Ask authors/readers for more resources
In this study, we investigate the effect of weight thresholding (WT) on the robustness of real-world complex networks. We find that real-world networks subjected to WT hold a robust connectivity structure to node attack even for higher WT values. Weighted node centralities are more stable indicators of node importance in real-world networks subjected to link sparsification compared to binary node centralities.
In this study, we investigate the effect of weight thresholding (WT) on the robustness of real-world complex networks. Here, we assess the robustness of networks after WT against various node attack strategies. We perform WT by removing a fixed fraction of weak links. The size of the largest connected component indicates the network's robustness. We find that real-world networks subjected to WT hold a robust connectivity structure to node attack even for higher WT values. In addition, we analyze the change in the top 30% of central nodes with WT and find a positive correlation in the ranking of central nodes for weighted node centralities. Differently, binary node centralities show a lower correlation when networks are subjected to WT. This result indicates that weighted node centralities are more stable indicators of node importance in real-world networks subjected to link sparsification.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available