Hostname: page-component-857557d7f7-wf4rb Total loading time: 0 Render date: 2025-11-20T19:50:48.220Z Has data issue: false hasContentIssue false
  • English
  • Français

ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES

Published online by Cambridge University Press:  08 August 2007

M. Kuba  and
A. Panholzer
M. Kuba
Affiliation:
Institut für Diskrete Mathematik und Geometrie Technische Universität Wien 1040 Wien Austria E-mail: markus.kuba@tuwien.ac.at; alois.panholzer@tuwien.ac.at
A. Panholzer
Affiliation:
Institut für Diskrete Mathematik und Geometrie Technische Universität Wien 1040 Wien Austria E-mail: markus.kuba@tuwien.ac.at; alois.panholzer@tuwien.ac.at
Get access Rights & Permissions [Opens in a new window]

Abstract

We study weighted path lengths (depths) and distances for increasing tree families. For those subclasses of increasing tree families, which can be constructed via an insertion process (e.g., recursive trees, plane-oriented recursive trees, and binary increasing trees), we can determine the limiting distribution that can be characterized as a generalized Dickman's infinitely divisible distribution.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 21 , Issue 3 , July 2007 , pp. 419 - 433
Copyright
2007 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable