Continuous-time digital search tree and a border aggregation model
From MaRDI portal
Publication:2676931
DOI10.3150/21-BEJ1429MaRDI QIDQ2676931
Debleena Thacker, Svante Janson
Publication date: 28 September 2022
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.13957
Discrete-time Markov processes on general state spaces (60J05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- A diffusion limit for a class of randomly-growing binary trees
- Internal diffusion limited aggregation
- Diffusion-limited aggregation on a tree
- The variance of the height of digital search trees
- Border aggregation model
- Internal DLA on cylinder graphs: fluctuations and mixing
- How long does it take for internal DLA to forget its initial profile?
- A functional limit theorem for the profile of search trees
- Random Trees
- Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
- Probability: A Graduate Course
- Node profiles of symmetric digital search trees: Concentration properties