Internal diffusion limited aggregation (Q1203669): Difference between revisions

Consider the model in which particles are repeatedly dropped at the original of the \(d\)-dimensional integers. Each successive particle then performs an independent simple symmetric time-discrete random walk until it reaches a site that has not been visited previously, at which point it stops. Let \(A(n)\) denote the cluster of occupied sites after \(n\)th particle stops. The paper deals with the shape of \(A(n)\). The main result of the paper is quite beautiful: Let \(\omega_ d\) be the volume of the \(d\)-dimensional ball of radius 1 and \(B_ r\) be the \(d\)-dimensional lattice ball of radius \(r\). Then, for any \(\varepsilon>0\), with probability 1, \[ B_{n(1-c)}\subset A(\omega_ d n^ d)\subset B_{n(1+c)} \] for all sufficient large \(n\). --- The time-continuous variant is also studied and some open problems are mentioned.