Stretched IDLA (Q2925413)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stretched IDLA |
scientific article; zbMATH DE number 6359750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stretched IDLA |
scientific article; zbMATH DE number 6359750 |
Statements
22 October 2014
0 references
internal diffusion limited aggregation
0 references
first passage percolation
0 references
stationarity
0 references
simple random walk
0 references
Poisson clock
0 references
ergodicity
0 references
math.PR
0 references
Stretched IDLA (English)
0 references
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.
0 references
