War pact model of shrinking networks
Open Access
- 10 October 2019
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 14 (10) , e0223480
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.Keywords
All Related Versions
Funding Information
- The Slovenian Research and Innovation Agency (P5-0168)
- European Cooperation in Science and Technology (CA15109)
This publication has 48 references indexed in Scilit:
- Universal fractal scaling of self-organized networksPhysica A: Statistical Mechanics and its Applications, 2011
- Hierarchical structure and the prediction of missing links in networksNature, 2008
- Portraits of complex networksEurophysics Letters, 2008
- Emergence of tempered preferential attachment from optimizationProceedings of the National Academy of Sciences, 2007
- Network clustering coefficient without degree-correlation biasesPhysical Review E, 2005
- Modeling interactome: scale-free or geometric?Bioinformatics, 2004
- LGL: Creating a Map of Protein Function with an Algorithm for Visualizing Very Large Biological NetworksJournal of Molecular Biology, 2004
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- Selection, tinkering, and emergence in complex networksComplexity, 2002
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998