How long does it take for Internal DLA to forget its initial profile?
View / Open Files
Publication Date
2019-08Journal Title
Probability Theory and Related Fields
ISSN
0178-8051
Publisher
Springer Science and Business Media LLC
Volume
174
Issue
3-4
Pages
1219-1271
Type
Article
This Version
VoR
Metadata
Show full item recordCitation
Levine, L., & Silvestri, V. (2019). How long does it take for Internal DLA to forget its initial profile?. Probability Theory and Related Fields, 174 (3-4), 1219-1271. https://doi.org/10.1007/s00440-018-0880-7
Abstract
Internal DLA is a discrete model of a moving interface. On the cylinder graph
$\mathbb{Z}_N \times \mathbb{Z}$, a particle starts uniformly on $\mathbb{Z}_N
\times \{0\}$ and performs simple random walk on the cylinder until reaching an
unoccupied site in $\mathbb{Z}_N \times \mathbb{Z}_{\geq 0}$, which it occupies
forever. This operation defines a Markov chain on subsets of the cylinder. We
first show that a typical subset is rectangular with at most logarithmic
fluctuations. We use this to prove that two Internal DLA chains started from
different typical subsets can be coupled with high probability by adding order
$N^2 \log N$ particles. For a lower bound, we show that at least order $N^2$
particles are required to forget which of two independent typical subsets the
process started from.
Identifiers
External DOI: https://doi.org/10.1007/s00440-018-0880-7
This record's URL: https://www.repository.cam.ac.uk/handle/1810/286403
Statistics
Total file downloads (since January 2020). For more information on metrics see the
IRUS guide.