IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0223480.html
   My bibliography  Save this article

War pact model of shrinking networks

Author

Listed:
  • Luka Naglić
  • Lovro Šubelj

Abstract

Many real systems can be described by a set of interacting entities forming a complex network. To some surprise, these have been shown to share a number of structural properties regardless of their type or origin. It is thus of vital importance to design simple and intuitive models that can explain their intrinsic structure and dynamics. These can, for instance, be used to study networks analytically or to construct networks not observed in real life. Most models proposed in the literature are of two types. A model can be either static, where edges are added between a fixed set of nodes according to some predefined rule, or evolving, where the number of nodes or edges increases over time. However, some real networks do not grow but rather shrink, meaning that the number of nodes or edges decreases over time. We here propose a simple model of shrinking networks called the war pact model. We show that networks generated in such a way exhibit common structural properties of real networks. Furthermore, compared to classical models, these resemble international trade, correlates of war, Bitcoin transactions and other networks more closely. Network shrinking may therefore represent a reasonable explanation of the evolution of some networks and greater emphasis should be put on such models in the future.

Suggested Citation

  • Luka Naglić & Lovro Šubelj, 2019. "War pact model of shrinking networks," PLOS ONE, Public Library of Science, vol. 14(10), pages 1-14, October.
  • Handle: RePEc:plo:pone00:0223480
    DOI: 10.1371/journal.pone.0223480
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0223480
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0223480&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0223480?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
    ---><---

    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. Jon M. Kleinberg, 2000. "Navigation in a small world," Nature, Nature, vol. 406(6798), pages 845-845, August.
    3. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    4. Yang-Yu Liu & Jean-Jacques Slotine & Albert-László Barabási, 2011. "Controllability of complex networks," Nature, Nature, vol. 473(7346), pages 167-173, May.
    5. Filippo Simini & Marta C. González & Amos Maritan & Albert-László Barabási, 2012. "A universal model for mobility and migration patterns," Nature, Nature, vol. 484(7392), pages 96-100, April.
    6. Anna D. Broido & Aaron Clauset, 2019. "Scale-free networks are rare," Nature Communications, Nature, vol. 10(1), pages 1-10, December.
    7. Manlio De Domenico & Vincenzo Nicosia & Alexandre Arenas & Vito Latora, 2015. "Structural reducibility of multilayer networks," Nature Communications, Nature, vol. 6(1), pages 1-9, November.
    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. Ren, Baoan & Zhang, Yu & Chen, Jing & Shen, Lincheng, 2019. "Efficient network disruption under imperfect information: The sharpening effect of network reconstruction with no prior knowledge," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 196-207.
    2. 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.
    3. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    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. Khalid Bakhshaliyev & Mehmet Hadi Gunes, 2020. "Generation of 2-mode scale-free graphs for link-level internet topology modeling," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-23, November.
    6. Shang, Yilun, 2021. "Generalized k-cores of networks under attack with limited knowledge," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    7. Yang-Yu Liu & Jean-Jacques Slotine & Albert-László Barabási, 2012. "Control Centrality and Hierarchical Structure in Complex Networks," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-7, September.
    8. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    9. Wang, Haiying & Moore, Jack Murdoch & Small, Michael & Wang, Jun & Yang, Huijie & Gu, Changgui, 2022. "Epidemic dynamics on higher-dimensional small world networks," Applied Mathematics and Computation, Elsevier, vol. 421(C).
    10. Rutger Goekoop & Jaap G Goekoop, 2014. "A Network View on Psychiatric Disorders: Network Clusters of Symptoms as Elementary Syndromes of Psychopathology," PLOS ONE, Public Library of Science, vol. 9(11), pages 1-47, November.
    11. Huang, Wei & Chen, Shengyong & Wang, Wanliang, 2014. "Navigation in spatial networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 132-154.
    12. 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.
    13. Rui Ding, 2019. "The Complex Network Theory-Based Urban Land-Use and Transport Interaction Studies," Complexity, Hindawi, vol. 2019, pages 1-14, June.
    14. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    15. Aura Reggiani, 2022. "The Architecture of Connectivity: A Key to Network Vulnerability, Complexity and Resilience," Networks and Spatial Economics, Springer, vol. 22(3), pages 415-437, September.
    16. Hou, Bonan & Yao, Yiping & Liao, Dongsheng, 2012. "Identifying all-around nodes for spreading dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(15), pages 4012-4017.
    17. Qing Cai & Mahardhika Pratama & Sameer Alam, 2019. "Interdependency and Vulnerability of Multipartite Networks under Target Node Attacks," Complexity, Hindawi, vol. 2019, pages 1-16, November.
    18. Chun Li & Xingwu Duan, 2020. "Exploration of Urban Interaction Features Based on the Cyber Information Flow of Migrant Concern: A Case Study of China’s Main Urban Agglomerations," IJERPH, MDPI, vol. 17(12), pages 1-20, June.
    19. 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.
    20. Yingli Wang & Qingpeng Zhang & Xiaoguang Yang, 2018. "Evolution of the Chinese Guarantee Network under Financial Crisis and Stimulus Program," Papers 1804.05667, arXiv.org, revised Jun 2020.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0223480. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.