Article,
Size-dependent degree distribution of a scale-free growing network
Phys Rev E, 63 (6): 062101 (2001)
Abstract
We propose the simplest model of scale-free growing networks and obtain the exact form of its degree distribution for any size of the network (degree is a number of connections of a node). We demonstrate that a trace of initial conditions --- a hump near cutoff of the degree distribution at kcut∼tβ --- may be found for any network size. Here β=1/(γ-1), where γ is the exponent of the degree distribution of the network. These size effects implement a natural boundary for the observation of the scale-free networks.
Tags
- 2001
- dorogotsev
- graphtheory
- growing
- imported
- mendes
- network
- networks
- samukhin
- scale-free
- scalefree
- smallworld
- socialnetwork
