Continuous time digital search tree and a border aggregation model

DOI10.3150/21-BEJ1429MaRDI QIDQ6339636arXivFDO

Authors Svante Janson, Debleena Thacker

Publication date 29 April 2020

Published in arXiv

Full work available at URL https://doi.org/10.3150/21-BEJ1429

Mathematics Subject Classification ID

Combinatorial probability (60C05) Discrete-time Markov processes on general state spaces (60J05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

arXiv classification

math.PR

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.

This page was built for publication: Continuous time digital search tree and a border aggregation model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6339636)