Tail Bounds for the Wiener Index of Random Trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2007

Tail Bounds for the Wiener Index of Random Trees

Résumé

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.
Fichier principal
Vignette du fichier
dmAH0121.pdf (197.29 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184772 , version 1 (17-08-2015)

Identifiants

Citer

Tämur Ali Khan, Ralph Neininger. Tail Bounds for the Wiener Index of Random Trees. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.307-318, ⟨10.46298/dmtcs.3524⟩. ⟨hal-01184772⟩

Collections

TDS-MACS
55 Consultations
545 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More