Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T11:29:24.070Z Has data issue: false hasContentIssue false

Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees

Published online by Cambridge University Press:  14 July 2016

Götz Olaf Munsonius*
Affiliation:
University of Freiburg
Ludger Rüschendorf*
Affiliation:
University of Freiburg
*
∗ Current address: Institute of Mathematics, University of Frankfurt, 60054 Frankfurt am Main, Germany. Email address: munsonius@math.uni-frankfurt.de
∗∗ Postal address: Department of Mathematical Stochastics, University of Freiburg, Eckerstraße 1, 79104 Freiburg, Germany. Email address: ruschen@stochastik.uni-freiburg.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Limit theorems are established for some functionals of the distances between two nodes in weighted random b-ary recursive trees. We consider the depth of the nth node and of a random node, the distance between two random nodes, the internal path length, and the Wiener index. As an application, these limit results imply, by an imbedding argument, corresponding limit theorems for further classes of random trees: plane-oriented recursive trees and random linear recursive trees.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2011