Stretched IDLA

From MaRDI portal



Abstract: We consider a new IDLA - particle system model, on the upper half planar lattice, resulting in an infinite forest covering the half plane. We prove that almost surely all trees are finite.


In this paper, the authors consider a new internal diffusion limited aggregation (IDLA) process in continuous time, introduced by Itai Benjamini, which is called stretched IDLA. This process starts with an infinite line. Every vertex on the line has a Poisson clock, every ring initiates an oriented simple random walk that can add an edge to the tree rooted at the vertex whose clock rang. The authors show that even though eventually all vertices are covered, all tress are finite.











This page was built for publication: Stretched IDLA

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