Continuous-time digital search tree and a border aggregation model
Continuous-time digital search tree and a border aggregation model
We consider the continuous-time version of the random digital search tree, and construct a coupling with a border aggregation model as studied in Thacker and Volkov (Ann. Appl. Probab. 28 (2018) 1604–1633), showing a relation between the height of the tree and the time required for aggregation. This relation carries …