2000 character limit reached
On the fluctuations of Internal DLA on the Sierpinski gasket graph
Published 20 May 2021 in math.PR | (2105.09745v2)
Abstract: Internal diffusion limited aggregation (IDLA) is a random aggregation model on a graph , whose clusters are formed by random walks started in the origin (some fixed vertex) and stopped upon visiting a previously unvisited site. On the Sierpinski gasket graph the asymptotic shape is known to be a ball in the usual graph metric. In this paper we establish bounds for the fluctuations of the cluster from its asymptotic shape.
Paper Prompts
Sign up for free to create and run prompts on this paper.