Related papers: Internal DLA on Sierpinski gasket graphs
In this paper, we analyze the scaling properties of a model that has as limiting cases the diffusion-limited aggregation (DLA) and the ballistic aggregation (BA) models. This model allows us to control the radial and angular scaling of the…
We identify sources of systematic error in traditional simulations of the Witten-Sander model of diffusion-limited aggregation (DLA) on a square lattice. We present an algorithm that reduces these biases to below $10^{-12}$. We grow…
Cylindrical lattice Diffusion Limited Aggregation (DLA), with a narrow width N, is solved using a Markovian matrix method. This matrix contains the probabilities that the front moves from one configuration to another at each growth step,…
We present and study the Pool model in $\mathbb{R}^2$, a rotationally symmetric analogue of Multi-Particle Diffusion-Limited Aggregation (MDLA), in which particles ("droplets") perform continuous-time random walks and are absorbed upon…
We consider the following problem in one-dimensional diffusion-limited aggregation (DLA). At time $t$, we have an "aggregate" consisting of $\Bbb{Z}\cap[0,R(t)]$ [with $R(t)$ a positive integer]. We also have $N(i,t)$ particles at $i$,…
Cylindrical lattice diffusion limited aggregation (DLA), with a narrow width N, is solved for site-sticking conditions using a Markovian matrix method (which was previously developed for the bond-sticking case). This matrix contains 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…
Aggregation phenomena are ubiquitous in nature, encompassing out-of-equilibrium processes of fractal pattern formation, important in many areas of science and technology. Despite their simplicity, foundational models such as…
We develop and implement an algorithm for the quantitative characterization of cluster dynamics occurring on cellular automata defined on an arbitrary structure. As a prototype for such systems we focus on the Ising model on a finite…
We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…
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.…
The initial purpose of this work is to provide a probabilistic explanation of a recent result on a version of Smoluchowski's coagulation equations in which the number of aggregations is limited. The latter models the deterministic evolution…
The method of iterated conformal maps for the study of Diffusion Limited Aggregates (DLA) is generalized to the study of Laplacian Growth Patterns and related processes. We emphasize the fundamental difference between these processes: DLA…
In an attempt to find generic features on the fractal growth of Au films deposited on Ru(001), a simple simulation model based on irreversible diffusion-limited aggregation (DLA) is discussed. Highly irregular two-dimensional dentritic…
In close analogy to diffusion limited aggregation (DLA) and inspired by a work of Roux, a random walker algorithm is constructed to solve the problem of crack growth in an elastic medium. In contrast to conventional lattice approaches, the…
We analyze a lattice model closely related to the one-dimensional inelastic gas with periodic boundary condition. The one-dimensional inelastic gas tends to form high density clusters of particles with almost the same velocity, separated by…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
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…
In this paper, we analyze the scaling behavior of \emph{Diffusion Limited Aggregation} (DLA) simulated by Hastings-Levitov method. We obtain the fractal dimension of the clusters by direct analysis of the geometrical patterns in a good…
Let $M$ be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees they admit. We show that a.s. the…