A hooray for Poisson approximation - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

A hooray for Poisson approximation


We give several examples for Poisson approximation of quantities of interest in the analysis of algorithms: the distribution of node depth in a binary search tree, the distribution of the number of losers in an election algorithm and the discounted profile of a binary search tree. A simple and well-known upper bound for the total variation distance between the distribution of a sum of independent Bernoulli variables and the Poisson distribution with the same mean turns out to be very useful in all three cases.
Fichier principal
Vignette du fichier
dmAD0118.pdf (131.78 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-01184029 , version 1 (12-08-2015)



Rudolf Grübel. A hooray for Poisson approximation. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.181-192, ⟨10.46298/dmtcs.3357⟩. ⟨hal-01184029⟩


54 View
614 Download



Gmail Mastodon Facebook X LinkedIn More