Containing internal diffusion limited aggregation
@article{ECP2862, author = {Hugo Duminil-Copin and Cyrille Lucas and Ariel Yadin and Amir Yehudayoff}, title = {Containing internal diffusion limited aggregation}, journal = {Electron. Commun. Probab.}, fjournal = {Electronic Communications in Probability}, volume = {18}, year = {2013}, keywords = {IDLA, Random Walk, Percolation}, abstract = {Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical percolation clusters of integer-lattices fill Euclidean balls, with high probability. In this article, we complete the picture and prove a limit-shape theorem for IDLA on such percolation clusters, by providing the corresponding upper bound.
The technique to prove upper bounds is new and robust: it only requires the existence of a ``good'' lower bound. Specifically, this way of proving upper bounds on IDLA clusters is more suitable for random environments than previous ways, since it does not harness harmonic measure estimates.
}, pages = {no. 50, 1-8}, issn = {1083-589X}, doi = {10.1214/ECP.v18-2862}, url = {http://ecp.ejpecp.org/article/view/2862}}