JavaScript is disabled for your browser. Some features of this site may not work without it.
Original version
Gruebel, Rudolf; Michailow, Igor: Random recursive trees: a boundary theory approach. In: Electronic Journal of Probability 20 (2015), UNSP 37. DOI: https://doi.org/10.1214/EJP.v20-3832
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in terms of the input sequence of the algorithm. We further show that this approach can be used to obtain strong limit theorems for various tree functionals, such as path length or the Wiener index.