Related papers: Diffusion limited aggregation in the layers model
We consider (a variant of) the external multi-particle diffusion-limited aggregation (MDLA) process of Rosenstock and Marquardt on the plane. Based on the recent findings of [11], [10] in one space dimension it is natural to conjecture that…
Generating visual layouts is an essential ingredient of graphic design. The ability to condition layout generation on a partial subset of component attributes is critical to real-world applications that involve user interaction. Recently,…
Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random…
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…
A new approach to the modeling of nonfree particle diffusion is presented. The approach uses a general setup based on geometric graphs (networks of curves), which means that particle diffusion in anything from arrays of barriers and pore…
Controllable layout generation refers to the process of creating a plausible visual arrangement of elements within a graphic design (e.g., document and web designs) with constraints representing design intentions. Although recent…
This paper studies a discrete dynamical system belonging to the class of the networks introduced by A.P.~Buslaev. The systems contains a finite set of contours. In any contour, there are cells and a group of particles. This group is called…
We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…
The flow and deposition of polydisperse granular materials is simulated through the Magnetic Diffusion Limited Aggregation (MDLA) model. The random walk undergone by an entity in the MDLA model is modified such that the trajectories are…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
We present a complete study of the Multiparticle Biased Diffusion-Limited Aggregation (MBDLA) model supplemented with surface difussion (SD), focusing on the relevance and effects of the latter transport mechanism. By comparing different…
We introduce the pushy random walk, where a walker can push multiple obstacles, thereby penetrating large distances in environments with finite obstacle density. This process provides a minimal model for experimentally observed interactions…
We study a hybrid computational model for integer factorization in which the only non-classical resource is access to an \emph{iterated diffusion process} on a finite graph. Concretely, a \emph{diffusion step} is defined to be one…
In this paper, we consider a non-homogeneous discrete-time Markov chain which can be seen as a toy model for the growth of the arms of the DLA (Diffusion limited aggregation) process in a sub-linear wedge. It is conjectured that in a thin…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
The recently discovered population of ultra-faint extended line emitters can account for the majority of the incidence rate of Damped Lyman Alpha systems (DLAs) at z ~ 3 if the line emission is interpreted as Ly alpha. We show here that a…
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…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
We consider weakly interacting diffusions on time varying random graphs. The system consists of a large number of nodes in which the state of each node is governed by a diffusion process that is influenced by the neighboring nodes. The…
In recent years, several experiments highlighted a new type of diffusion anomaly, which was called Brownian yet non-Gaussian diffusion. In systems displaying this behavior, the mean squared displacement of the diffusing particles grows…