Finite-time fluctuations in the degree statistics of growing networks
From MaRDI portal
(Redirected from Publication:846923)
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'asi-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.
Recommendations
- Finiteness and fluctuations in growing networks
- Convergence properties of the degree distribution of some growing network models
- On the degree evolution of a fixed vertex in some growing networks
- Carrying capacity in growing networks
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
Cites work
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- A simple stochastic model for the dynamics of condensation
- Complex networks: structure and dynamics
- Dynamical Processes on Complex Networks
- Dynamics of condensation in zero-range processes
- Emergence of Scaling in Random Networks
- Finiteness and fluctuations in growing networks
- Statistical mechanics of complex networks
Cited in
(4)
This page was built for publication: Finite-time fluctuations in the degree statistics of growing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846923)