IDEAS home Printed from https://ideas.repec.org/a/wsi/acsxxx/v23y2020i01ns0219525920500010.html
   My bibliography  Save this article

Multi-Hop Generalized Core Percolation On Complex Networks

Author

Listed:
  • YILUN SHANG

    (Department of Computer and Information Sciences, Northumbria University, Ellison Place, Newcastle upon Tyne NE1 8ST, UK)

Abstract

Recent theoretical studies on network robustness have focused primarily on attacks by random selection and global vision, but numerous real-life networks suffer from proximity-based breakdown. Here we introduce the multi-hop generalized core percolation on complex networks, where nodes with degree less than k and their neighbors within L-hop distance are removed progressively from the network. The resulting subgraph is referred to as G(k,L)-core, extending the recently proposed Gk-core and classical core of a network. We develop analytical frameworks based upon generating function formalism and rate equation method, showing for instance continuous phase transition for G(2,1)-core and discontinuous phase transition for G(k,L)-core with any other combination of k and L. We test our theoretical results on synthetic homogeneous and heterogeneous networks, as well as on a selection of large-scale real-world networks. This unravels, e.g., a unique crossover phenomenon rooted in heterogeneous networks, which raises a caution that endeavor to promote network-level robustness could backfire when multi-hop tracing is involved.

Suggested Citation

  • Yilun Shang, 2020. "Multi-Hop Generalized Core Percolation On Complex Networks," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 23(01), pages 1-15, March.
    • Handle: RePEc:wsi:acsxxx:v:23:y:2020:i:01:n:s0219525920500010
    DOI: 10.1142/S0219525920500010
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/abs/10.1142/S0219525920500010
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219525920500010?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. M. Mézard & G. Parisi, 2001. "The Bethe lattice spin glass revisited," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 20(2), pages 217-233, March.
    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. Weiping Wang & Saini Yang & H. Eugene Stanley & Jianxi Gao, 2019. "Local floods induce large-scale abrupt failures of road networks," Nature Communications, Nature, vol. 10(1), pages 1-11, December.
    4. Anna D. Broido & Aaron Clauset, 2019. "Scale-free networks are rare," Nature Communications, Nature, vol. 10(1), pages 1-10, December.
    5. 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.
    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. Julia García Cabello & Pedro A. Castillo & Maria-del-Carmen Aguilar-Luzon & Francisco Chiclana & Enrique Herrera-Viedma, 2021. "A Methodology for Redesigning Networks by Using Markov Random Fields," Mathematics, MDPI, vol. 9(12), pages 1-13, June.

    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. 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.
    20. Wang, Wei & Cai, Meng & Zheng, Muhua, 2018. "Social contagions on correlated multiplex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 121-128.

    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:wsi:acsxxx:v:23:y:2020:i:01:n:s0219525920500010. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/acs/acs.shtml .

    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.