Random recursive tree

In probability theory, a random recursive tree is a rooted tree chosen uniformly at random from the recursive trees with a given number of vertices.

Definition and generation

In a recursive tree with $n$ vertices, the vertices are labeled by the numbers from $1$ to $n$ , and the labels must decrease along any path to the root of the tree. These trees are unordered, in the sense that there is no distinguished ordering of the children of each vertex. In a random recursive tree, all such trees are equally likely.

Alternatively, a random recursive tree can be generated by starting from a single vertex, the root of the tree, labeled $1$ , and then for each successive label from $2$ to $n$ choosing a random vertex with a smaller label to be its parent. If each of the choices is uniform and independent of the other choices, the resulting tree will be a random recursive tree.

Properties

With high probability, the longest path from the root to the leaf of an $n$ -vertex random recursive tree has length $e\log n$ .[1] The maximum number of children of any vertex in the tree is, with high probability, $(1\pm o(1))\log n$ .[2] The expected distance of the $k$ th vertex from the root is the $k$ th harmonic number, from which it follows by linearity of expectation that the sum of all root-to-vertex path lengths is, with high probability, $(1\pm o(1))n\log n$ .[3] The expected number of leaves of the tree is $n/2$ with variance $n/12$ , so with high probability the number of leaves is $(1\pm o(1))n/2$ .[4]

Applications

Zhang (2015) lists several applications of random recursive trees in modeling phenomena including disease spreading, pyramid schemes, the evolution of languages, and the growth of computer networks.[4]

gollark: Oh, well, yes.

gollark: Yes it does.

gollark: If possibly more than the once per tick it should be.

gollark: It's technically yielding.

gollark: You can catch too long without yielding, but your computer will be force-shutdown if you keep not yielding.

References

Pittel, Boris (1994), "Note on the heights of random recursive trees and random $m$ -ary search trees", Random Structures & Algorithms, 5 (2): 337–347, doi:10.1002/rsa.3240050207, MR 1262983
Goh, William; Schmutz, Eric (2002), "Limit distribution for the maximum degree of a random recursive tree", Journal of Computational and Applied Mathematics, 142 (1): 61–82, doi:10.1016/S0377-0427(01)00460-5, MR 1910519
Dobrow, Robert P.; Fill, James Allen (1999), "Total path length for random recursive trees", Combinatorics, Probability and Computing, 8 (4): 317–333, doi:10.1017/S0963548399003855, MR 1723646
Zhang, Yazhe (2015), "On the number of leaves in a random recursive tree", Brazilian Journal of Probability and Statistics, 29 (4): 897–908, doi:10.1214/14-BJPS252, MR 3397399

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[p-1] Pittel, Boris (1994), "Note on the heights of random recursive trees and random $m$ -ary search trees", Random Structures & Algorithms, 5 (2): 337–347, doi:10.1002/rsa.3240050207, MR 1262983

[gs-2] Goh, William; Schmutz, Eric (2002), "Limit distribution for the maximum degree of a random recursive tree", Journal of Computational and Applied Mathematics, 142 (1): 61–82, doi:10.1016/S0377-0427(01)00460-5, MR 1910519

[df-3] Dobrow, Robert P.; Fill, James Allen (1999), "Total path length for random recursive trees", Combinatorics, Probability and Computing, 8 (4): 317–333, doi:10.1017/S0963548399003855, MR 1723646

[z-4] Zhang, Yazhe (2015), "On the number of leaves in a random recursive tree", Brazilian Journal of Probability and Statistics, 29 (4): 897–908, doi:10.1214/14-BJPS252, MR 3397399