Geometric Bucket Trees: Analysis of Linear Bucket Tree

Philippe Jacquet (1) , Paul Mühlethaler (1)

1 HIPERCOM - High performance communication

We analyse the average number of buckets in a Linear Bucket tree created by $n$ points uniformly dispatched on an interval of length $y$. A new bucket is created when a point does not fall in an existing bucket. The bucket is the interval of length 2 centered on the point. We illustrate this concept by an interesting tale of how the moon's surface took on its present form. Thanks to an explicit Laplace transform of the Poissonized sequence, and the use of dePoissonization tools, we obtain the explicit asymptotic expansions of the average number of buckets in most of the asymptotic regimes relative to $n$ and $y$.

Mots clés: bucket tree

Domaines: Algorithme et structure de données [cs.DS]; Combinatoire [math.CO]; Mathématique discrète [cs.DM]; Géométrie algorithmique [cs.CG]

Philippe Jacquet, Paul Mühlethaler. Geometric Bucket Trees: Analysis of Linear Bucket Tree. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.401-414, ⟨10.46298/dmtcs.2764⟩. ⟨hal-01185562⟩