Related papers: Diamond Aggregation
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…
We performed extensive numerical simulation of diffusion-limited aggregation in two dimensional channel geometry. Contrary to earlier claims, the measured fractal dimension D = 1.712 +- 0.002 and its leading correction to scaling are the…
Aggregation-diffusion equations are foundational tools for modelling biological aggregations. Their principal use is to link the collective movement mechanisms of organisms to their emergent space use patterns in a concrete mathematical…
In the classical model of Diffusion Limited Aggregation (DLA), introduced by Witten and Sander, the process begins with a single particle cluster placed at the origin of a space, and then, one at a time, particles make a random walk from…
It had been conjectured that Diffusion Limited Aggregates and Laplacian Growth patterns (with small surface tension) are in the same universality class. Using iterated conformal maps we construct a 1-parameter family of fractal growth…
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…
Diffusion-Limited Aggregation (DLA), the canonical model for non-equilibrium fractal growth, emerges from the simple rule of irreversible attachment by random walkers. Despite four decades of study, a unified computational framework…
A fundamental insight in the theory of diffusive random walks is that the mean length of trajectories traversing a finite open system is independent of the details of the diffusion process. Instead, the mean trajectory length depends only…
We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…
Starting from the model of continuous time random walk, we focus our interest on random walks in which the probability distributions of the waiting times and jumps have fat tails characterized by power laws with exponent between 0 and 1 for…
We study the asymptotic behaviour of a random walk whose evolution is dependent on the state of an itself dynamically evolving environment. In particular, we extend our previous results in [Bethuelsen and V\"ollering, 2016] and prove a…
We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
We consider the discrete time unitary dynamics given by a quantum walk on the lattice $\Z^d$ performed by a quantum particle with internal degree of freedom, called coin state, according to the following iterated rule: a unitary update of…
We investigate statistical properties of trails formed by a random process incorporating aggregation, fragmentation, and diffusion. In this stochastic process, which takes place in one spatial dimension, two neighboring trails may combine…
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 consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under…
A non--linear diffusion equation is derived by taking into account hopping rates depending on the occupation of next neighbouring sites. There appears additonal repulsive and attractive forces leading to a changed local mobiltiy. The…
We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…