On the fluctuations of Internal DLA on the Sierpinski gasket graph
Abstract
Internal diffusion limited aggregation (IDLA) is a random aggregation model on a graph G, 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.