IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v489y2018icp47-55.html
   My bibliography  Save this article

Robustness of weighted networks

Author

Listed:
  • Bellingeri, Michele
  • Cassi, Davide

Abstract

Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency).

Suggested Citation

  • Bellingeri, Michele & Cassi, Davide, 2018. "Robustness of weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 489(C), pages 47-55.
    • Handle: RePEc:eee:phsmap:v:489:y:2018:i:c:p:47-55
    DOI: 10.1016/j.physa.2017.07.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117307082
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2017.07.020?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Crucitti, Paolo & Latora, Vito & Marchiori, Massimo & Rapisarda, Andrea, 2004. "Error and attack tolerance of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 340(1), pages 388-394.
    2. Bellingeri, Michele & Cassi, Davide & Vincenzi, Simone, 2014. "Efficiency of attack strategies on complex model and real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 174-180.
    3. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    4. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    5. Bellingeri, Michele & Cassi, Davide & Vincenzi, Simone, 2013. "Increasing the extinction risk of highly connected species causes a sharp robust-to-fragile transition in empirical food webs," Ecological Modelling, Elsevier, vol. 251(C), pages 1-8.
    6. Barthélemy, Marc & Barrat, Alain & Pastor-Satorras, Romualdo & Vespignani, Alessandro, 2005. "Characterization and modeling of weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 346(1), pages 34-43.
    7. Nie, Tingyuan & Guo, Zheng & Zhao, Kun & Lu, Zhe-Ming, 2015. "New attack strategies for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 248-253.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2024. "Robustness of Real-World Networks after Weight Thresholding with Strong Link Removal," Mathematics, MDPI, vol. 12(10), pages 1-16, May.
    2. Stefano Martinazzi & Andrea Flori, 2020. "The evolving topology of the Lightning Network: Centralization, efficiency, robustness, synchronization, and anonymity," PLOS ONE, Public Library of Science, vol. 15(1), pages 1-18, January.
    3. Moore, Jack Murdoch & Small, Michael & Yan, Gang, 2021. "Inclusivity enhances robustness and efficiency of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    4. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    5. Bellingeri, M. & Bevacqua, D. & Scotognella, F. & LU, Zhe-Ming & Cassi, D., 2018. "Efficacy of local attack strategies on the Beijing road complex weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 316-328.
    6. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2023. "Effect of Weight Thresholding on the Robustness of Real-World Complex Networks to Central Node Attacks," Mathematics, MDPI, vol. 11(16), pages 1-12, August.
    7. Lekha, Divya Sindhu & Balakrishnan, Kannan, 2020. "Central attacks in complex networks: A revisit with new fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).
    8. Yang, Yu & He, Ze & Song, Zouying & Fu, Xin & Wang, Jianwei, 2018. "Investigation on structural and spatial characteristics of taxi trip trajectory network in Xi’an, China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 755-766.
    9. Zhao, Peixin & Yin, Shengnan & Han, Xue & Li, Zhuyue, 2021. "Research on lean supply chain network model based on node removal," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 567(C).
    10. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    11. Xia Cao & Chuanyun Li & Wei Chen & Jinqiu Li & Chaoran Lin, 2020. "Research on the invulnerability and optimization of the technical cooperation innovation network based on the patent perspective—A case study of new energy vehicles," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-19, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bellingeri, M. & Bevacqua, D. & Scotognella, F. & LU, Zhe-Ming & Cassi, D., 2018. "Efficacy of local attack strategies on the Beijing road complex weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 316-328.
    2. Gao, Yan-Li & Chen, Shi-Ming & Nie, Sen & Ma, Fei & Guan, Jun-Jie, 2018. "Robustness analysis of interdependent networks under multiple-attacking strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 495-504.
    3. Hao, Yucheng & Jia, Limin & Wang, Yanhui, 2020. "Edge attack strategies in interdependent scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    4. Bellingeri, Michele & Cassi, Davide & Vincenzi, Simone, 2014. "Efficiency of attack strategies on complex model and real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 174-180.
    5. Weihua Lei & Luiz G. A. Alves & Luís A. Nunes Amaral, 2022. "Forecasting the evolution of fast-changing transportation networks using machine learning," Nature Communications, Nature, vol. 13(1), pages 1-12, December.
    6. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2024. "Robustness of Real-World Networks after Weight Thresholding with Strong Link Removal," Mathematics, MDPI, vol. 12(10), pages 1-16, May.
    7. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    8. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    9. Curado, Manuel & Rodriguez, Rocio & Tortosa, Leandro & Vicent, Jose F., 2022. "Anew centrality measure in dense networks based on two-way random walk betweenness," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    10. Yang, Yu & He, Ze & Song, Zouying & Fu, Xin & Wang, Jianwei, 2018. "Investigation on structural and spatial characteristics of taxi trip trajectory network in Xi’an, China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 755-766.
    11. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    12. Lekha, Divya Sindhu & Balakrishnan, Kannan, 2020. "Central attacks in complex networks: A revisit with new fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).
    13. Massimiliano Turchetto & Michele Bellingeri & Roberto Alfieri & Ngoc-Kim-Khanh Nguyen & Quang Nguyen & Davide Cassi, 2023. "Random Walks-Based Node Centralities to Attack Complex Networks," Mathematics, MDPI, vol. 11(23), pages 1-20, November.
    14. Tian, Meng & Dong, Zhengcheng & Wang, Xianpei, 2021. "Reinforcement learning approach for robustness analysis of complex networks with incomplete information," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    15. Fei, Liguo & Deng, Yong, 2017. "A new method to identify influential nodes based on relative entropy," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 257-267.
    16. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2023. "Effect of Weight Thresholding on the Robustness of Real-World Complex Networks to Central Node Attacks," Mathematics, MDPI, vol. 11(16), pages 1-12, August.
    17. Duan-Bing Chen & Hui Gao & Linyuan Lü & Tao Zhou, 2013. "Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    18. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    19. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    20. Quayle, A.P. & Siddiqui, A.S. & Jones, S.J.M., 2006. "Preferential network perturbation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 823-840.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:489:y:2018:i:c:p:47-55. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.