E Ben-Naim and P L Krapivsky 2009 J. Phys. A: Math. Theor. 42 475001 doi:10.1088/1751-8113/42/47/475001
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.
Issue 47 (27 November 2009)
Received 4 September 2009
Published 4 November 2009
E Ben-Naim and P L Krapivsky 2009 J. Phys. A: Math. Theor. 42 475001
S L Rumyantsev et al 2008 Semicond. Sci. Technol. 23 105001
Liao Ming-Liang et al 2009 Chinese Phys. Lett. 26 114207
L Blackburn et al 2008 Class. Quantum Grav. 25 184004
Yuan Chang-Qing et al 2009 Chinese Phys. Lett. 26 118701
W Schröer and V R Vale 2009 J. Phys.: Condens. Matter 21 424119
Todd D Fansler et al 2009 Meas. Sci. Technol. 20 125401
Alessandro Arcovito et al 2009 J. Phys.: Conf. Ser. 190 012195
M Patra et al 2009 J. Phys.: Condens. Matter 21 486003
Andrea Di Cicco et al 2009 J. Phys.: Conf. Ser. 190 012043