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

Vulnerability of labeled networks

Author

Listed:
  • Trpevski, Daniel
  • Smilkov, Daniel
  • Mishkovski, Igor
  • Kocarev, Ljupco

Abstract

We propose a metric for vulnerability of labeled graphs that has the following two properties: (1) when the labeled graph is considered as an unlabeled one, the metric reduces to the corresponding metric for an unlabeled graph; and (2) the metric has the same value for differently labeled fully connected graphs, reflecting the notion that any arbitrarily labeled fully connected topology is equally vulnerable as any other. A vulnerability analysis of two real-world networks, the power grid of the European Union, and an autonomous system network, has been performed. The networks have been treated as graphs with node labels. The analysis consists of calculating characteristic path lengths between labels of nodes and determining largest connected cluster size under two node and edge attack strategies. Results obtained are more informative of the networks’ vulnerability compared to the case when the networks are modeled with unlabeled graphs.

Suggested Citation

  • Trpevski, Daniel & Smilkov, Daniel & Mishkovski, Igor & Kocarev, Ljupco, 2010. "Vulnerability of labeled networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(23), pages 5538-5549.
    • Handle: RePEc:eee:phsmap:v:389:y:2010:i:23:p:5538-5549
    DOI: 10.1016/j.physa.2010.08.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437110006904
    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.2010.08.008?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, 2003. "Efficiency of scale-free networks: error and attack tolerance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 320(C), pages 622-642.
    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. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.

    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. Andrea Avena-Koenigsberger & Xiaoran Yan & Artemy Kolchinsky & Martijn P van den Heuvel & Patric Hagmann & Olaf Sporns, 2019. "A spectrum of routing strategies for brain networks," PLOS Computational Biology, Public Library of Science, vol. 15(3), pages 1-24, March.
    2. Zhou, Yaoming & Wang, Junwei, 2018. "Efficiency of complex networks under failures and attacks: A percolation approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 658-664.
    3. Yu, Juanya & Sharma, Neetesh & Gardoni, Paolo, 2024. "Functional connectivity analysis for modeling flow in infrastructure," Reliability Engineering and System Safety, Elsevier, vol. 247(C).
    4. Zhao, Jianyu & Wei, Jiang & Yu, Lean & Xi, Xi, 2022. "Robustness of knowledge networks under targeted attacks: Electric vehicle field of China evidence," Structural Change and Economic Dynamics, Elsevier, vol. 63(C), pages 367-382.
    5. Fabio Della Rossa & Lorenzo Giannini & Pietro DeLellis, 2020. "Herding or wisdom of the crowd? Controlling efficiency in a partially rational financial market," PLOS ONE, Public Library of Science, vol. 15(9), pages 1-16, September.
    6. Viljoen, Nadia M. & Joubert, Johan W., 2016. "The vulnerability of the global container shipping network to targeted link disruption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 396-409.
    7. Zio, Enrico, 2016. "Challenges in the vulnerability and risk analysis of critical infrastructures," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 137-150.
    8. César Yajure & Darihelen Montilla & Jose Emmanuel Ramirez-Marquez & Claudio M Rocco S, 2013. "Network vulnerability assessment via bi-objective optimization with a fragmentation approach as proxy," Journal of Risk and Reliability, , vol. 227(6), pages 576-585, December.
    9. Morehead, Raymond & Noore, Afzel, 2007. "Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 603-612.
    10. Jalili, Mahdi, 2011. "Synchronizability of dynamical scale-free networks subject to random errors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4588-4595.
    11. Chen, Wei & Jiang, Manrui & Jiang, Cheng & Zhang, Jun, 2020. "Critical node detection problem for complex network in undirected weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    12. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    13. Youzhong Wang & Daniel Zeng & Bin Zhu & Xiaolong Zheng & Feiyue Wang, 2014. "Patterns of news dissemination through online news media: A case study in China," Information Systems Frontiers, Springer, vol. 16(4), pages 557-570, September.
    14. Yongliang Deng & Liangliang Song & Zhipeng Zhou & Ping Liu, 2017. "An Approach for Understanding and Promoting Coal Mine Safety by Exploring Coal Mine Risk Network," Complexity, Hindawi, vol. 2017, pages 1-17, October.
    15. Pan, Shouzheng & Ling, Shuai & Jia, Ning & Liu, Yiliu & He, Zhengbing, 2024. "On the dynamic vulnerability of an urban rail transit system and the impact of human mobility," Journal of Transport Geography, Elsevier, vol. 116(C).
    16. Bingxue Qian & Ning Zhang, 2022. "Topology and Robustness of Weighted Air Transport Networks in Multi-Airport Region," Sustainability, MDPI, vol. 14(11), pages 1-15, June.
    17. Yingying Xing & Jian Lu & Shengdi Chen & Sunanda Dissanayake, 2017. "Vulnerability analysis of urban rail transit based on complex network theory: a case study of Shanghai Metro," Public Transport, Springer, vol. 9(3), pages 501-525, October.
    18. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    19. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    20. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli, 2021. "Robustness of scale-free networks with dynamical behavior against multi-node perturbation," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).

    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:389:y:2010:i:23:p:5538-5549. 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.