Internal aggregation models with multiple sources and obstacle problems on Sierpinski gaskets
Uta Freiberg, Nico Heizmann, Robin Kaiser, Ecaterina Sava-Huss

TL;DR
This paper studies the scaling limits of three aggregation models on the Sierpinski gasket, showing they converge to a deterministic free boundary problem solution on the fractal, with analysis of boundary regularity.
Contribution
It establishes the convergence of divisible sandpile, internal DLA, and rotor aggregation models on fractal graphs to a free boundary problem solution on the Sierpinski gasket.
Findings
Models converge to a free boundary problem solution on the fractal.
The limit shape is characterized by an obstacle problem on the Sierpinski gasket.
Boundary regularity properties of the limit shape are analyzed.
Abstract
We consider the doubly infinite Sierpinski gasket graph , rescale it by factor , and on the rescaled graphs , for every , we investigate the limit shape of three aggregation models with initial configuration of particles supported on multiple vertices. The models under consideration are: divisible sandpile in which the excess mass is distributed among the vertices until each vertex is stable and has mass less or equal to one, internal DLA in which particles do random walks until finding an empty site, and rotor aggregation in which particles perform deterministic counterparts of random walks until finding an empty site. We denote by the infinite Sierpinski gasket, which is a closed subset of , for which represents the level-n approximating graph, and we consider a continuous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Theoretical and Computational Physics · Stochastic processes and statistical mechanics
