EXTERNAL PATH LENGTH OF RANDOM m-ORIENTED RECURSIVE

The random recursive tree is a combinatorial structure used to model a variety of applications such as contagion, chain letters, philology, etc. In this paper, we determine the expectation and variance of Xn the external path length in a random m-oriented recursive tree of size n.