Continuous time digital search tree and a border aggregation model
Probability
2020-04-30 v1
Abstract
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 (2018), showing a relation between the height of the tree and the time required for aggregation. This relation carries over to the corresponding discrete-time models. As a consequence we find a very precise asymptotic result for the time to aggregation, using recent results by Drmota et al.\ (2020) for the digital search tree.
Keywords
Cite
@article{arxiv.2004.13957,
title = {Continuous time digital search tree and a border aggregation model},
author = {Svante Janson and Debleena Thacker},
journal= {arXiv preprint arXiv:2004.13957},
year = {2020}
}
Comments
16 pages