2 papers
math.PR2019
The impatient collector
Anis Amri, Philippe Chassaing
In the coupon collector problem with items, the collector needs a random number of tries to complete the collection. Also, after tries, the collector ha…
math.PR2017
On weighted depths in random binary search trees
Rafik Aguech, Anis Amri, Henning Sulzbach
Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of a…