Random Records and Cuttings in Split Trees: Extended Abstract
We study the number of records in random split trees on $n$ randomly labelled vertices. Equivalently the number of random cuttings required to eliminate an arbitrary random split tree can be studied. After normalization the distributions are shown to be asymptotically $1$-stable. This work is a gene...
| 主要作者: | |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| 丛编: | Discrete Mathematics & Theoretical Computer Science |
| 主题: | |
| 在线阅读: | https://dmtcs.episciences.org/3570/pdf |