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

Synchronizability of dynamical scale-free networks subject to random errors

Author

Listed:
  • Jalili, Mahdi

Abstract

In this paper the robustness of network synchronizability against random deletion of nodes, i.e. errors, in dynamical scale-free networks was studied. To this end, two measures of network synchronizability, namely, the eigenratio of the Laplacian and the order parameter quantifying the degree of phase synchrony were adopted, and the synchronizability robustness on preferential attachment scale-free graphs was investigated. The findings revealed that as the network size decreases, the robustness of its synchronizability against random removal of nodes declines, i.e. the more the number of randomly removed nodes from the network, the worse its synchronizability. We also showed that this dependence of the synchronizability on the network size is different with that in the growing scale-free networks. The profile of a number of network properties such as clustering coefficient, efficiency, assortativity, and eccentricity, as a function of the network size was investigated in these two cases, growing scale-free networks and those with randomly removed nodes. The results showed that these processes are also different in terms of these metrics.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:390:y:2011:i:23:p:4588-4595
    DOI: 10.1016/j.physa.2011.06.053
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437111005000
    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.2011.06.053?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. 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.
    2. Richard J. Williams & Neo D. Martinez, 2000. "Simple rules yield complex food webs," Nature, Nature, vol. 404(6774), pages 180-183, March.
    3. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    4. 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. Shen, Yi, 2014. "The similarity of weights on edges and discovering of community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 560-570.
    2. 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.

    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. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    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. 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.
    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. 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.
    7. 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.
    8. Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
    9. 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.
    10. Jihui Han & Wei Li & Longfeng Zhao & Zhu Su & Yijiang Zou & Weibing Deng, 2017. "Community detection in dynamic networks via adaptive label propagation," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-16, November.
    11. 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.
    12. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    13. Prasanna Gai & Sujit Kapadia, 2011. "A Network Model of Super-Systemic Crises," Central Banking, Analysis, and Economic Policies Book Series, in: Rodrigo Alfaro (ed.),Financial Stability, Monetary Policy, and Central Banking, edition 1, volume 15, chapter 13, pages 411-432, Central Bank of Chile.
    14. 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.
    15. Qingmin Hao & Jim Huangnan Shen & Chien-Chiang Lee, 2023. "Risk contagion of bank-firm loan network: evidence from China," Eurasian Business Review, Springer;Eurasia Business and Economics Society, vol. 13(2), pages 341-361, June.
    16. 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.
    17. Gordana Apic & Matthew J Betts & Robert B Russell, 2011. "Content Disputes in Wikipedia Reflect Geopolitical Instability," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-5, June.
    18. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.
    19. Gao, Bo & Deng, Zhenghong & Zhao, Dawei, 2016. "Competing spreading processes and immunization in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 93(C), pages 175-181.
    20. 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.

    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:390:y:2011:i:23:p:4588-4595. 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.