DOAJ Open Access 2007

Tail Bounds for the Wiener Index of Random Trees

Tämur Ali Khan Ralph Neininger

Lihat Sumber DOI

Abstrak

Upper and lower bounds for the tail probabilities of the Wiener index of random binary search trees are given. For upper bounds the moment generating function of the vector of Wiener index and internal path length is estimated. For the lower bounds a tree class with sufficiently large probability and atypically large Wiener index is constructed. The methods are also applicable to related random search trees.

Topik & Kata Kunci

Mathematics

Penulis (2)

Tämur Ali Khan

Ralph Neininger

Format Sitasi

APA MLA BibTeX

Khan, T.A., Neininger, R. (2007). Tail Bounds for the Wiener Index of Random Trees. https://doi.org/10.46298/dmtcs.3524

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.3524

Informasi Jurnal

Tahun Terbit: 2007
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.3524
Akses: Open Access ✓