E Ben-Naim and P L Krapivsky 2009 J. Phys. A: Math. Theor. 42 475001 doi:10.1088/1751-8113/42/47/475001
Stratification in the preferential attachment network
E Ben-Naim1 and P L Krapivsky2
Show affiliationsWe 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(n)k of nodes with degree k at depth n has a power-law tail, f(n)k ~ k−γ(n). The exponent grows linearly with depth, 
, 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 redirection.
- PACS
- MSC
- Subjects
- Dates
-
Issue 47 (27 November 2009)
Received 4 September 2009
Published 4 November 2009
-
Stratification in the preferential attachment network
E Ben-Naim and P L Krapivsky 2009 J. Phys. A: Math. Theor. 42 475001
-
Front propagation in flipping processes
T Antal et al 2008 J. Phys. A: Math. Theor. 41 465002
-
Preferential killing of cancer cells and activated human T cells using ZnO nanoparticles
Cory Hanley et al 2008 Nanotechnology 19 295103
Users also read
What's this?- Parity-odd effects and polarization rotation in graphene
- Integral formulae for the eigenvalue density of complex random matrices
- Degree-based graph construction
supergravity chiral projection operator