Related papers: Diffusion limited aggregation in the layers model
In this work, the transition between diffusion-limited and ballistic aggregation models was revisited using a model in which biased random walks simulate the particle trajectories. The bias is controlled by a parameter $\lambda$, which…
We develop the skeleton algorithm to define the number of main branches $N_b$ of diffusion-limited aggregation (DLA) clusters. The skeleton algorithm provides a systematic way to remove dangling side branches of the DLA cluster and has…
A recently proposed theory for diffusion-limited aggregation (DLA), which models this system as a random branched growth process, is reviewed. Like DLA, this process is stochastic, and ensemble averaging is needed in order to define…
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…
We employ the recently introduced conformal iterative construction of Diffusion Limited Aggregates (DLA) to study the multifractal properties of the harmonic measure. The support of the harmonic measure is obtained from a dynamical process…
Diffusion-coagulation can be simply described by a dynamic where particles perform a random walk on a lattice and coalesce with probability unity when meeting on the same site. Such processes display non-equilibrium properties with strong…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
What is the scaling limit of diffusion limited aggregation (DLA) in the plane? This is an old and famously difficult question. One can generalize the question in two ways: first, one may consider the {\em dielectric breakdown model}…
A parallel algorithm for ``diffusion-limited aggregation'' (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel…
The process by which one may take a discrete model of a biophysical process and construct a continuous model based on it is of mathematical interest as well as being of practical use. In this paper, we first study the singular limit of a…
Recently, the diffusion-limited cluster aggregation (DLCA) model was restudied as a real-world example of showing discontinuous percolation transitions (PTs). Because a larger cluster is less mobile in Brownian motion, it comes into contact…
We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples…
We present dla-ideal-solver, a high-performance framework for simulating two-dimensional Diffusion-Limited Aggregation (DLA) using Numba-accelerated Python. By leveraging just-in-time (JIT) compilation, we achieve computational throughput…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
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…
We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…
Though classical random walks have been studied for many years, research concerning their quantum analogues, quantum random walks, has only come about recently. Numerous simulations of both types of walks have been run and analyzed, and are…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
Internal diffusion-limited aggregation is a growth model based on random walk in Z^d. We study how the shape of the aggregate depends on the law of the underlying walk, focusing on a family of walks in Z^2 for which the limiting shape is a…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time…