A note on the distance in random recursive trees
Recursive trees have been used to model such things as the spread of epidemics, family trees of ancient manuscripts, and pyramid schemes. A tree Tn with n labeled nodes is a random recursive tree if n=1, or n>1 and Tn can be constructed by joining node n to a node of some recursive tree Tn-1 with the same probability 1/(n-1). For arbitrary positive integer i=in[less-than-or-equals, slant]n-1, a function of n, we demonstrate Din,n, the distance between nodes in and n in random recursive trees, is asymptotically normal as n-->[infinity] by using the classical limit theory method.
Year of publication: |
2006
|
---|---|
Authors: | Su, Chun ; Liu, Jie ; Feng, Qunqiang |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 76.2006, 16, p. 1748-1755
|
Publisher: |
Elsevier |
Keywords: | Random recursive tree Distance Law of large numbers Central limit theorem |
Saved in:
Saved in favorites
Similar items by person
-
Limit laws for the Randić index of random binary tree models
Feng, Qunqiang, (2008)
-
Limit laws for the Randić index of random binary tree models
Feng, Qunqiang, (2008)
-
Liu, Jie, (2010)
- More ...