Carrying capacity in growing networks. (19th April 2016)

• Record Type: Journal Article
• Authors: Hase, M O; Casa Grande, H L
• Is Part Of: Journal of statistical mechanics. (2016:Apr.)
• Publication Date: 2016-04-19
• Subjects: Statistical mechanics -- Periodicals; Mechanics -- Statistical methods -- Periodicals; 530.1305
• DOI: 10.1088/1742-5468/2016/04/043304
• Languages: English
• ISSNs: 1742-5468

Abstract

Abstract: In this work, a growing network model that can generate a random network with a finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus–Verhulst model in the context of population growth. The degree distribution is analysed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time. For finite times, the time-dependent degree distribution displays an accumulation of hubs as a result of competition between attractive and repulsive terms in linking probability.