Related papers: Diffusion limited aggregation in the layers model
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a…
Results from a modified Diffusion Limited Aggregation (DLA) model are presented. The modifications of the classical DLA model are in the attachment to the cluster rules and in the scheme of particle generation/killing. In the classical DLA…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
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…
Diffusion-Limited Aggregation (DLA) is a cluster-growth model that consists in a set of particles that are sequentially aggregated over a two-dimensional grid. In this paper, we introduce a biased version of the DLA model, in which…
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…
Diffusion limited aggregation (DLA) is a well studied phenomenon in which diffusing particles cumulatively aggregate on a starting fixed seed point, forming a pattern which is fractal in structure. Here we report an interesting DLA process…
Internal Diffusion Limited Aggregation is an interacting particle system that describes the growth of a random cluster governed by the boundary harmonic measure seen from an internal point. Our paper studies IDLA in $\mathbb{Z}^d$ driven by…
We propose a revision of the classic mean-field approach of diffusion-limited aggregation (DLA) model originally introduced by Witten and Sander [Phys. Rev. Lett. 47, 1400 (1981)]. The derived nonlinear mean-field equations providing…
Internal diffusion-limited aggregation (IDLA) is a stochastic growth model on a graph $G$ which describes the formation of a random set of vertices growing from the origin (some fixed vertex) of $G$. Particles start at the origin and…
The paper suggests a generalisation of the diffusion-limited aggregation (DLA) based on using a general stochastic process to control particle movements before sticking to a growing cluster. This leads to models with variable…
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…
Several models based on the diffusion-limited aggregation (DLA) model were proposed and their scaling properties explored by computational and theoretical approaches. In this paper, we consider a new extension of the on-lattice DLA model in…
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…
We introduce a lattice gas model of cluster growth via the diffusive aggregation of particles in a closed system obeying a local, deterministic, microscopically reversible dynamics. This model roughly corresponds to placing the irreversible…
In the present note we analyze the one-dimensional multi-particle diffusion limited aggregation (MDLA) model: the initial number of particles at each positive integer site has Poisson distribution with mean $\mu$, independently of all other…
We propose a simple model of columnar growth through {\it diffusion limited aggregation} (DLA). Consider a graph $G_N\times\N$, where the basis has $N$ vertices $G_N:=\{1,\dots,N\}$, and two vertices $(x,h)$ and $(x',h')$ are adjacent if…
Internal DLA (IDLA) is an internal aggregation model in which particles perform random walks from the origin, in turn, and stop upon reaching an unoccupied site. Levine and Peres showed that, when particles start instead from fixed…
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…
Diffusion limited aggregation is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this…