Finite-time fluctuations in the degree statistics of growing networks
arXiv:0907.1470 · doi:10.1007/s10955-009-9847-5
Abstract
This paper presents a comprehensive analysis of the degree statistics in models for growing networks where new nodes enter one at a time and attach to one earlier node according to a stochastic rule. The models with uniform attachment, linear attachment (the Barabási-Albert model), and generalized preferential attachment with initial attractiveness are successively considered. The main emphasis is on finite-size (i.e., finite-time) effects, which are shown to exhibit different behaviors in three regimes of the size-degree plane: stationary, finite-size scaling, large deviations.
arXiv comment33 pages, 7 figures, 1 table
References in corpus (21)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Evolution of networks
- Mean-field theory for scale-free random networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Bose-Einstein condensation in complex networks
- Cut-offs and finite size effects in scale-free networks
- Generic scale of the "scale-free" growing networks
- Statistical ensemble of scale-free random graphs
- Finiteness and Fluctuations in Growing Networks
- A simple stochastic model for the dynamics of condensation
- Statistics of Lead Changes in Popularity-Driven Systems
- Nonequilibrium dynamics of urn models
- A record-driven growth process
- Preferencial growth: exact solution of the time dependent distributions
- Asymmetric evolving random networks
- Analytical results for stochastically growing networks: connection to the zero range process
- Finite size effects in Barabasi-Albert growing networks
- Dynamics of condensation in growing complex networks