Related papers: Fast simulation of large-scale growth models
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…
We compute the growth fluctuations in equilibrium of a wide class of deposition models. These models also serve as general frame to several nearest-neighbor particle jump processes, e.g. the simple exclusion or the zero range process, where…
In a recent paper (Bogoyavlenskiy V A 2002 \JPA \textbf{35} 2533), an algorithm aiming to generate isotropic clusters of the on-lattice diffusion-limited aggregation (DLA) model was proposed. The procedure consists of aggregation…
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…
Systems far from equilibrium approach stability slowly due to "anti-mixing" characterized by regions of the phase-space that remain disconnected after prolonged action of the flow. We introduce the Optimal Growth Mode (OGM) to capture this…
We consider a model of aggregation, both diffusion-limited and ballistic, based on the Cayley tree. Growth is from the leaves of the tree towards the root, leading to non-trivial screening and branch competition effects. The model exhibits…
In this paper, we introduce the stationary harmonic measure in the upper half plane. By bounding this measure, we are able to define both the discrete and continuous time diffusion limit aggregation (DLA) in the upper half plane with…
Understanding and optimizing thin-film synthesis requires measuring the diffusion length $d_\alpha$ of adsorbed growth precursors. Despite technological advances, in-situ measurements of $d_\alpha$ are often unachievable due to harsh…
We study one-dimensional multi-particle Diffusion Limited Aggregation (MDLA) at its critical density $\lambda=1$. Previous works have verified that the size of the aggregate $X_t$ at time $t$ is $t^{1/2}$ in the subcritical regime and…
Algorithms have been estimated to increase AI training FLOP efficiency by a factor of 22,000 between 2012 and 2023 [Ho et al., 2024]. Running small-scale ablation experiments on key innovations from this time period, we are able to account…
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…
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…
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…
We present exact results for a lattice model of cluster growth in 1D. The growth mechanism involves interface hopping and pairwise annihilation supplemented by spontaneous creation of the stable-phase, +1, regions by overturning the…
We consider a generalization of the classical logistic growth model introducing more than one inflection point. The growth, called multi-sigmoidal, is firstly analyzed from a deterministic point of view in order to obtain the main…
We consider a lognormal diffusion process having a multisigmoidal logistic mean, useful to model the evolution of a population which reaches the maximum level of the growth after many stages. Referring to the problem of statistical…
We study the relation between stochastic and continuous transport-limited growth models, which generalize conformal-mapping formulations of diffusion-limited aggregation (DLA) and viscous fingering, respectively. We derive a nonlinear…
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 diffusion limited aggregation model (DLA) and the more general dielectric breakdown model (DBM) are solved exactly in a two dimensional cylindrical geometry with periodic boundary conditions of width 2. Our approach follows the exact…
Diffusion models have achieved remarkable success in image generation, yet their deployment remains constrained by the heavy computational cost and the need for numerous inference steps. Previous efforts on fewer-step distillation attempt…