Article contents
ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES
Published online by Cambridge University Press: 08 August 2007
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.
- 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
- 3
- Cited by