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.

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, i.e., degree, in the tree is, with high probability, $(1\pm o(1))\log _{2}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]

Random recursive tree

Properties

Applications

References

Related Articles