Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Robustness of Real-World Networks after Weight Thresholding by Strong Link Removal

Version 1 : Received: 28 February 2024 / Approved: 29 February 2024 / Online: 29 February 2024 (11:40:09 CET)

How to cite: John, J.M.; Bellingeri, M.; Lekha, D.S.; Cassi, D.; Alfieri, R. Robustness of Real-World Networks after Weight Thresholding by Strong Link Removal. Preprints 2024, 2024021674. https://doi.org/10.20944/preprints202402.1674.v1 John, J.M.; Bellingeri, M.; Lekha, D.S.; Cassi, D.; Alfieri, R. Robustness of Real-World Networks after Weight Thresholding by Strong Link Removal. Preprints 2024, 2024021674. https://doi.org/10.20944/preprints202402.1674.v1

Abstract

Weight thresholding (WT) is a method intended to decrease the number of links within weighted networks that may otherwise be excessively dense for network science applications. WT aims to remove links to simplify the networks by holding most of the features of the original network. Here, we test the robustness and the efficacy of the node attack strategies on real-world networks subjected to WT that remove links of higher weight (strong links). We measure the network robustness along node removal with the largest connected component (LCC). We find that the real-world networks under study are generally stable in terms of robustness when subjected to WT. Nonetheless, WT by strong link removal changes the efficacy of the attack strategies and the rank of node centralities. Also, WT by strong link removal may trigger a greater change in node centrality rank than WT by removing weak links. Network science research finding important/influential nodes in the network has to consider that simplifying the network with WT methodologies may change the node centrality.

Keywords

complex networks; complex systems; graph theory; network robustness

Subject

Physical Sciences, Other

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.