Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 4:58:57 PM
Last modification on : Thursday, May 11, 2017 - 1:03:03 AM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:15:12 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads