𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weighted height of random trees

✍ Scribed by N. Broutin; L. Devroye; E. McLeish

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
740 KB
Volume
45
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Total Heights of Random Rooted Bi
On the Total Heights of Random Rooted Binary Trees
✍ L. Takacs πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 306 KB

Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the

The Height of Increasing Trees
The Height of Increasing Trees
✍ Michael Drmota πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 466 KB