Branches in scale-free trees

被引：0

作者：

Dondajewski M. ^{[1
]}

Szymański J. ^{[2
]}

机构：

[1] Poznań University of Technology, Department of Mathematics, Poznań

[2] Adam Mickiewicz University, Department of Discrete Mathematics, Poznań

来源：

Journal of Mathematical Sciences | 2009年 / 161卷 / 6期

关键词：

Degree Distribution; Recurrence Equation; Preferential Attachment; Vertex Degree; Degree Sequence;

D O I：

10.1007/s10958-009-9615-8

中图分类号：

学科分类号：

摘要：

In the paper the scale-free (preferential attachment) model of a random recursive tree is considered. We deal with the size and the distribution of vertex degrees in the kth branch of such a tree (which is the subtree rooted at vertex labeled k). A comparison of these results with analogous results for the whole tree shows that the k-branch of a scale-free tree can be considered as a scale-free tree itself with the number of vertices being random variables. © 2009 Springer Science+Business Media, Inc.

引用

页码：961 / 968

页数：7

共 8 条

[1]

Barabasi A.-L., Albert R., Jeong H., Scale-free characteristics of random networks: The topology of the world-wide web, Phys. A, 281, pp. 69-77, (2000)

[2]

Bergeron F., Flajolet P., Salvy B., Varieties of increasing trees, Lecture Notes in Comput. Sci., (1992)

[3]

Bollobas A.-L., Riordan O., Spencer J., Tusnady G., The degree sequence of a scale-free random graph process, Random Structures Algorithms, 18, pp. 279-290, (2001)

[4]

Mahmoud H., Smythe R.T., A survey of recursive trees, Theory Probab. Math. Statist., 51, pp. 1-29, (1996)

[5]

Mahmoud H., Smythe R.T., Szymanski J., On the structure of random plane-oriented recursive trees and their branches, Random Structures Algorithms, 4, pp. 151-176, (1993)

[6]

Szymanski J., On the nonuniform random recursive tree, Ann. Discrete Math., 33, pp. 297-306, (1987)

[7]

Szymanski J., Branches in recursive trees, Fasc. Math., 29, pp. 139-147, (1999)

[8]

Szymanski J., Concentration of vertex degrees of a scale-free random graph process, Random Structures Algorithms, 26, pp. 224-236, (2005)

← 1 →