Tail Bounds for the Wiener Index of Random Trees

Abstract : 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.
Type de document :
Communication dans un congrès
Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.307-318, 2007, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184772
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 17 août 2015 - 16:58:57
Dernière modification le : jeudi 11 mai 2017 - 01:03:03
Document(s) archivé(s) le : mercredi 18 novembre 2015 - 12:15:12

Fichier

dmAH0121.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184772, version 1

Collections

Citation

Tämur Ali Khan, Ralph Neininger. Tail Bounds for the Wiener Index of Random Trees. Jacquet, Philippe. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), pp.307-318, 2007, DMTCS Proceedings. 〈hal-01184772〉

Partager

Métriques

Consultations de la notice

60

Téléchargements de fichiers

116