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

Robustness of networks with assortative dependence groups

Author

Listed:
  • Wang, Hui
  • Li, Ming
  • Deng, Lin
  • Wang, Bing-Hong

Abstract

Assortativity is one of the important characteristics in real networks. To study the effects of this characteristic on the robustness of networks, we propose a percolation model on networks with assortative dependence group. The assortativity in this model means that the nodes with the same or similar degrees form dependence groups, for which one node fails, other nodes in the same group are very likely to fail. We find that the assortativity makes the nodes with large degrees easier to survive from the cascading failure. In this way, such networks are more robust than that with random dependence group, which also proves the assortative network is robust in another perspective. Furthermore, we also present exact solutions to the size of the giant component and the critical point, which are in agreement with the simulation results well.

Suggested Citation

  • Wang, Hui & Li, Ming & Deng, Lin & Wang, Bing-Hong, 2018. "Robustness of networks with assortative dependence groups," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 195-200.
    • Handle: RePEc:eee:phsmap:v:502:y:2018:i:c:p:195-200
    DOI: 10.1016/j.physa.2018.02.150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711830219X
    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.2018.02.150?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. 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.
    2. 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.
    3. Hui Wang & Ming Li & Lin Deng & Bing-Hong Wang, 2015. "Percolation on Networks with Conditional Dependence Group," PLOS ONE, Public Library of Science, vol. 10(5), pages 1-10, May.
    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, Min & Wang, Xiaojuan & Jin, Lei & Song, Mei, 2021. "Cascade phenomenon in multilayer networks with dependence groups and hierarchical structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    2. Zhou, Jian & Coit, David W. & Felder, Frank A. & Wang, Dali, 2021. "Resiliency-based restoration optimization for dependent network systems against cascading failures," Reliability Engineering and System Safety, Elsevier, vol. 207(C).
    3. Zhang, Lan & Huang, Changwei, 2023. "Preferential selection to promote cooperation on degree–degree correlation networks in spatial snowdrift games," Applied Mathematics and Computation, Elsevier, vol. 454(C).
    4. Wang, Shuliang & Lv, Wenzhuo & Zhao, Longfeng & Nie, Sen & Stanley, H. Eugene, 2019. "Structural and functional robustness of networked critical infrastructure systems under different failure scenarios," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 476-487.

    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. 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.
    2. Liu, Run-Ran & Chu, Changchang & Meng, Fanyuan, 2023. "Higher-order interdependent percolation on hypergraphs," Chaos, Solitons & Fractals, Elsevier, vol. 177(C).
    3. Zhu, Qian & Zhu, Zhiliang & Wang, Yifan & Yu, Hai, 2016. "Fuzzy-information-based robustness of interconnected networks against attacks and failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 458(C), pages 194-203.
    4. Wouter Vermeer & Otto Koppius & Peter Vervest, 2018. "The Radiation-Transmission-Reception (RTR) model of propagation: Implications for the effectiveness of network interventions," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-21, December.
    5. Lu, Qing-Chang & Xu, Peng-Cheng & Zhao, Xiangmo & Zhang, Lei & Li, Xiaoling & Cui, Xin, 2022. "Measuring network interdependency between dependent networks: A supply-demand-based approach," Reliability Engineering and System Safety, Elsevier, vol. 225(C).
    6. Gangwal, Utkarsh & Singh, Mayank & Pandey, Pradumn Kumar & Kamboj, Deepak & Chatterjee, Samrat & Bhatia, Udit, 2022. "Identifying early-warning indicators of onset of sudden collapse in networked infrastructure systems against sequential disruptions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    7. Wang, Jianwei & Jiang, Chen & Qian, Jianfei, 2014. "Robustness of interdependent networks with different link patterns against cascading failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 535-541.
    8. Hayato Goto & Hideki Takayasu & Misako Takayasu, 2017. "Estimating risk propagation between interacting firms on inter-firm complex network," PLOS ONE, Public Library of Science, vol. 12(10), pages 1-12, October.
    9. Liu, Hao & Chen, Xin & Huo, Long & Zhang, Yadong & Niu, Chunming, 2022. "Impact of inter-network assortativity on robustness against cascading failures in cyber–physical power systems," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    10. Jiang, Zhong-Yuan & Zeng, Yong & Liu, Zhi-Hong & Ma, Jian-Feng, 2019. "Identifying critical nodes’ group in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 121-132.
    11. Jordán, Ferenc, 2022. "The network perspective: Vertical connections linking organizational levels," Ecological Modelling, Elsevier, vol. 473(C).
    12. 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.
    13. Nguyen, Win P.V. & Nof, Shimon Y., 2020. "Strategic lines of collaboration in response to disruption propagation (CRDP) through cyber-physical systems," International Journal of Production Economics, Elsevier, vol. 230(C).
    14. 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.
    15. Cui, Pengshuai & Zhu, Peidong & Wang, Ke & Xun, Peng & Xia, Zhuoqun, 2018. "Enhancing robustness of interdependent network by adding connectivity and dependence links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 185-197.
    16. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    17. 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).
    18. Zhang, Tianqiao & Zhang, Yang & Zhu, Xuzhen & Chen, Junliang, 2019. "Cascading failures on interdependent networks with star dependent links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    19. Zhou, Lin & Qi, Xiaogang & Liu, Lifang, 2023. "Robustness of networks with dependency groups considering fluctuating loads and recovery behaviors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 613(C).
    20. Lee, Joohyun & Kwak, Jaewook & Lee, Hyang-Won & Shroff, Ness B., 2018. "Finding minimum node separators: A Markov chain Monte Carlo method," Reliability Engineering and System Safety, Elsevier, vol. 178(C), pages 225-235.

    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:502:y:2018:i:c:p:195-200. 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.