Stratification in the Preferential Attachment Network
arXiv:0905.1920 · doi:10.1088/1751-8113/42/47/475001
Abstract
We study structural properties of trees grown by preferential attachment. In this mechanism, nodes are added sequentially and attached to existing nodes at a rate that is strictly proportional to the degree. We classify nodes by their depth n, defined as the distance from the root of the tree, and find that the network is strongly stratified. Most notably, the distribution f_k^(n) of nodes with degree k at depth n has a power-law tail, f_k^(n) ~ k^{-γ(n)}. The exponent grows linearly with depth, gamma(n)=2+(n-1)/<n-1>, where the brackets denote an average over all nodes. Therefore, nodes that are closer to the root are better connected, and moreover, the degree distribution strongly varies with depth. Similarly, the in-component size distribution has a power-law tail and the characteristic exponent grows linearly with depth. Qualitatively, these behaviors extend to a class of networks that grow by a redirection mechanism.
6 pages, 4 figures
References in corpus (13)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Evolution of networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- Generic scale of the "scale-free" growing networks
- Finiteness and Fluctuations in Growing Networks
- Statistics of Lead Changes in Popularity-Driven Systems
- Preferencial growth: exact solution of the time dependent distributions
- On the Tomography of Networks and Multicast Trees