No CrossRef data available.
Published online by Cambridge University Press: 21 May 2018
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree. An application is given to the sum over all pairs of nodes of the common number of ancestors.
Partly supported by the Knut and Alice Wallenberg Foundation.