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

Evaluation of network robustness using a node tearing algorithm

Author

Listed:
  • Ma, A.
  • Mondragón, R.J.

Abstract

Until recently the study of failure and vulnerability in complex networks focused on the role of high degree nodes, and the relationship between their removal and network connectivity. Recent evidence suggested that in some network configurations, the removal of lower degree nodes can also cause network fragmentation. We present a disassembling algorithm that identifies nodes that are core to network connectivity. The algorithm is based on network tearing in which communities are defined and used to construct a hierarchical structure. Cut-nodes, which are located at the boundaries of the communities, are the key interest. Their importance in the overall network connectivity is characterized by their participation with neighbouring communities in each level of the hierarchy. We examine the impact of these cut-nodes by studying the change in size of the giant component, local and global efficiencies, and how the algorithm can be combined with other community detection methods to reveal the finer internal structure within a community.

Suggested Citation

  • Ma, A. & Mondragón, R.J., 2012. "Evaluation of network robustness using a node tearing algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(24), pages 6674-6681.
    • Handle: RePEc:eee:phsmap:v:391:y:2012:i:24:p:6674-6681
    DOI: 10.1016/j.physa.2012.07.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437112007273
    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.2012.07.058?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. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    2. Sun, Shiwen & Liu, Zhongxin & Chen, Zengqiang & Yuan, Zhuzhi, 2007. "Error and attack tolerance of evolving networks with local preferential attachment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 373(C), pages 851-860.
    3. Ghedini, Cinara G. & Ribeiro, Carlos H.C., 2011. "Rethinking failure and attack tolerance assessment in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4684-4691.
    4. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    5. Colizza, Vittoria & Flammini, Alessandro & Maritan, Amos & Vespignani, Alessandro, 2005. "Characterization and modeling of protein–protein interaction networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 352(1), pages 1-27.
    Full references (including those not matched with items on IDEAS)

    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. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    2. 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.
    3. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    4. 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.
    5. Li, Xin-Feng & Lu, Zhe-Ming, 2016. "Optimizing the controllability of arbitrary networks with genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 422-433.
    6. Wang, Tao & Cheng, Heming & Wang, Xiaoxia, 2020. "A link addition method based on uniformity of node degree in interdependent power grids and communication networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 560(C).
    7. Wang, Wensheng & Karimi, Faezeh & Khalilpour, Kaveh & Green, David & Varvarigos, Manos, 2023. "Robustness analysis of electricity networks against failure or attack: The case of the Australian National Electricity Market (NEM)," International Journal of Critical Infrastructure Protection, Elsevier, vol. 41(C).
    8. Chen, Sai & Ding, Yueting & Zhang, Yanfang & Zhang, Ming & Nie, Rui, 2022. "Study on the robustness of China's oil import network," Energy, Elsevier, vol. 239(PB).
    9. Peng, Xingzhao & Yao, Hong & Du, Jun & Wang, Zhe & Ding, Chao, 2015. "Invulnerability of scale-free network against critical node failures based on a renewed cascading failure model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 69-77.
    10. Cerqueti, Roy & Ciciretti, Rocco & Dalò, Ambrogio & Nicolosi, Marco, 2022. "A new measure of the resilience for networks of funds with applications to socially responsible investments," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    11. Jing Liu & Huapu Lu & He Ma & Wenzhi Liu, 2017. "Network Vulnerability Analysis of Rail Transit Plans in Beijng-Tianjin-Hebei Region Considering Connectivity Reliability," Sustainability, MDPI, vol. 9(8), pages 1-17, August.
    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. Xing Zhou & Wei Peng & Zhen Xu & Bo Yang, 2015. "Hardness Analysis and Empirical Studies of the Relations among Robustness, Topology and Flow in Dynamic Networks," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-29, December.
    14. Marcel Salathé & James H Jones, 2010. "Dynamics and Control of Diseases in Networks with Community Structure," PLOS Computational Biology, Public Library of Science, vol. 6(4), pages 1-11, April.
    15. Li, Wenyuan & Lin, Yongjing & Liu, Ying, 2007. "The structure of weighted small-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 376(C), pages 708-718.
    16. Sun, Shiwen & Li, Ruiqi & Wang, Li & Xia, Chengyi, 2015. "Reduced synchronizability of dynamical scale-free networks with onion-like topologies," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 249-256.
    17. Ji, Junzhong & Song, Xiangjing & Liu, Chunnian & Zhang, Xiuzhen, 2013. "Ant colony clustering with fitness perception and pheromone diffusion for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(15), pages 3260-3272.
    18. Havlin, Shlomo & Stanley, H. Eugene & Bashan, Amir & Gao, Jianxi & Kenett, Dror Y., 2015. "Percolation of interdependent network of networks," Chaos, Solitons & Fractals, Elsevier, vol. 72(C), pages 4-19.
    19. 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).
    20. Saniee Monfared, Momhammad Ali & Jalili, Mahdi & Alipour, Zohreh, 2014. "Topology and vulnerability of the Iranian power grid," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 24-33.

    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:391:y:2012:i:24:p:6674-6681. 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.