IDEAS home Printed from https://ideas.repec.org/a/eee/infome/v5y2011i3p422-430.html
   My bibliography  Save this article

Error and attack tolerance of small-worldness in complex networks

Author

Listed:
  • Jalili, Mahdi

Abstract

Complex networks may undergo random and/or systematic failures in some of their components, i.e. nodes and edges. These failures may influence various network properties. In this article, for a number of real-world as well as Watts–Strogatz model networks, we investigated the profile of the network small-worldness as random failures, i.e. errors, or systematic failures, i.e. attacks, occurred in the nodes. In errors nodes are randomly removed along with all their tipping edges, while in attacks the nodes with highest degrees are removed from the network. Interestingly, in many cases, the small-worldness of violated networks increased as more nodes underwent an attack. This indicates an important role of the hub nodes in controlling the small-worldness of Watts–Strogatz networks. The profile of changes in the small-worldness as a result of errors/attacks was independent of network size, while it was influenced by average degree and rewiring probability of Watts–Strogatz model. We also found that the pattern of the changes of the small-worldness in real-world networks is completely different than that of the Watts–Strogatz networks. Therefore, although Watts–Strogatz model is often used for constructing networks with small-world property, the resulting networks have different properties compared to real-world ones in terms of robustness in the small-worldness index against errors/attacks.

Suggested Citation

  • Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    • Handle: RePEc:eee:infome:v:5:y:2011:i:3:p:422-430
    DOI: 10.1016/j.joi.2011.03.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1751157711000332
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.joi.2011.03.002?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. 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.
    2. N. Barkai & S. Leibler, 1997. "Robustness in simple biochemical networks," Nature, Nature, vol. 387(6636), pages 913-917, June.
    3. Sergey V. Buldyrev & Roni Parshani & Gerald Paul & H. Eugene Stanley & Shlomo Havlin, 2010. "Catastrophic cascade of failures in interdependent networks," Nature, Nature, vol. 464(7291), pages 1025-1028, April.
    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. Jon M. Kleinberg, 2000. "Navigation in a small world," Nature, Nature, vol. 406(6798), pages 845-845, August.
    6. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    7. 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.
    8. Richard J. Williams & Neo D. Martinez, 2000. "Simple rules yield complex food webs," Nature, Nature, vol. 404(6774), pages 180-183, March.
    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. Zhang, Haihong & Wu, Wenqing & Zhao, Liming, 2016. "A study of knowledge supernetworks and network robustness in different business incubators," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 545-560.
    2. Lu, Shuai & Li, Shouwei & Zhou, Wei & Yang, Wenke, 2022. "Network herding of energy funds in the post-Carbon-Peak Policy era: Does it benefit profitability and stability?," Energy Economics, Elsevier, vol. 109(C).
    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. Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).
    5. 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.
    6. Li, Yuhong & Zobel, Christopher W., 2020. "Exploring supply chain network resilience in the presence of the ripple effect," International Journal of Production Economics, Elsevier, vol. 228(C).

    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. 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.
    2. 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.
    3. Milena Oehlers & Benjamin Fabian, 2021. "Graph Metrics for Network Robustness—A Survey," Mathematics, MDPI, vol. 9(8), pages 1-48, April.
    4. 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).
    5. Kong, Linghao & Wang, Lizhi & Cao, Zhongzheng & Wang, Xiaohong, 2024. "Resilience evaluation of UAV swarm considering resource supplementation," Reliability Engineering and System Safety, Elsevier, vol. 241(C).
    6. 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.
    7. 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.
    8. 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).
    9. Aymeric Vié & Alfredo J. Morales, 2021. "How Connected is Too Connected? Impact of Network Topology on Systemic Risk and Collapse of Complex Economic Systems," Computational Economics, Springer;Society for Computational Economics, vol. 57(4), pages 1327-1351, April.
    10. Zhang, Jianhua & Wang, Shuliang & Wang, Xiaoyuan, 2018. "Comparison analysis on vulnerability of metro networks based on complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 72-78.
    11. 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.
    12. Jianxi Gao & Xueming Liu & Daqing Li & Shlomo Havlin, 2015. "Recent Progress on the Resilience of Complex Networks," Energies, MDPI, vol. 8(10), pages 1-24, October.
    13. Dong, Gaogao & Tian, Lixin & Du, Ruijin & Fu, Min & Stanley, H. Eugene, 2014. "Analysis of percolation behaviors of clustered networks with partial support–dependence relations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 370-378.
    14. Guo, Shengmin & Wu, Ruoqian & Tong, Qingfeng & Zeng, Guanwen & Yang, Jian & Chen, Long & Zhu, Tongyu & Lv, Weifeng & Li, Daqing, 2018. "Is city traffic damaged by torrential rain?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 1073-1080.
    15. Rui Ding & Norsidah Ujang & Hussain Bin Hamid & Mohd Shahrudin Abd Manan & Rong Li & Safwan Subhi Mousa Albadareen & Ashkan Nochian & Jianjun Wu, 2019. "Application of Complex Networks Theory in Urban Traffic Network Researches," Networks and Spatial Economics, Springer, vol. 19(4), pages 1281-1317, December.
    16. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli & Yao, Shirui, 2022. "Cascading failure in networks with dynamical behavior against multi-node removal," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    17. Xu, Xiaohan & Huang, Ailing & Shalaby, Amer & Feng, Qian & Chen, Mingyang & Qi, Geqi, 2024. "Exploring cascading failure processes of interdependent multi-modal public transit networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 638(C).
    18. Chen, Lei & Yue, Dong & Dou, Chunxia, 2019. "Optimization on vulnerability analysis and redundancy protection in interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1216-1226.
    19. He, He & Yang, Bo & Hu, Xiaoming, 2016. "Exploring community structure in networks by consensus dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 342-353.
    20. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.

    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:infome:v:5:y:2011:i:3:p:422-430. 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.elsevier.com/locate/joi .

    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.