Related papers: Perfect boundaries in rotor-router aggregation on …
We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…
We consider a cluster growth model on Z^d, called internal diffusion limited aggregation (internal DLA). In this model, random walks start at the origin, one at a time, and stop moving when reaching a site not occupied by previous walks. It…
Diffusion-limited cluster aggregation (DLCA) is a well established model for the formation of highly porous low-density non-equilibrium structures. One of the main conclusions of the previous studies considering this model is that the…
We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
Internal DLA is a discrete random growth model describing growing clusters of particles. Its limiting shape and fluctuations are well understood when the underlying graph is the $d$-dimensional lattice or the cylinder $\mathbb{Z}_N \times…
Building on earlier work of Diaconis and Fulton (1991) and Lawler, Bramson, and Griffeath (1992), Propp in 2001 defined a deterministic analogue of internal diffusion-limited aggregation. This growth model is a "convergent game" of the sort…
We study the rotor-router walk with the clockwise ordering of outgoing edges on the semi-infinite cylinder. Imposing uniform conditions on the boundary of the cylinder, we consider growth of the cluster of visited sites and its internal…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
We study the structure and growth of a difusion-limited aggregate (DLA) for which the constitutive units remain mobile during the aggregation process. Contrary to DLA where far from equilibrium conditions are the prevalent factor for…
We study internal diffusion limited aggregation on $\mathbb{Z}$, where a cluster is grown incrementally by adding, for each random walk dispatched from the origin, the first site it reaches outside the cluster. We assume that the increment…
We consider a cluster growth model on the d-dimensional lattice, called internal diffusion limited aggregation (internal DLA). In this model, random walks start at the origin, one at a time, and stop moving when reaching a site not occupied…
We develop a general theory of transport-limited aggregation phenomena occurring on curved surfaces, based on stochastic iterated conformal maps and conformal projections to the complex plane. To illustrate the theory, we use stereographic…
We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes…
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process.…
We study the scaling limits of three different aggregation models on Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform deterministic analogues of…
The two-dimensional comb lattice $C_2$ is a natural spanning tree of the Euclidean lattice $\mathbb{Z}^2$. We study three related cluster growth models on $C_2$: internal diffusion limited aggregation (IDLA), in which random walkers move on…
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…
The rotor-router model is a deterministic analogue of random walk invented by Jim Propp. It can be used to define a deterministic aggregation model analogous to internal diffusion limited aggregation. We prove an isoperimetric inequality…
Diffusion-limited aggregation (DLA) assumes that particles perform pure random walk at a finite temperature and aggregate when they come close enough and stick together. Although it is well known that DLA in two dimensions results in a…