Related papers: Border aggregation model
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…
An individual-based model of stochastic branching is proposed and studied, in which point particles drift in $\bar{\mathds{R}}_{+}:=[0,+\infty)$ towards the origin (edge) with unit speed, where each of them splits into two particles that…
A simple, discrete, parametric model is proposed to describe conditional (correlated) deposition of particles on a surface and formation of a connecting (percolating) cluster. The surface changes spontaneously its properties (phase…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
Let $X$ be either $Z^d$ or the points of a Poisson process in $R^d$ of intensity 1. Given parameters $r$ and $p$, join each pair of points of $X$ within distance $r$ independently with probability $p$. This is the simplest case of a…
We examine diffusion-limited aggregation generated by a random walk on Z with long jumps. We derive upper and lower bounds on the growth rate of the aggregate as a function of the number moments a single step of the walk has. Under various…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
Using the matrix product formalism we formulate a natural p-species generalization of the asymmetric simple exclusion process. In this model particles hop with their own specific rate and fast particles can overtake slow ones with a rate…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
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…
In many applications, transport of particles can be described by the diffusion equation, or its convective-diffusion generalizations, in part of three-dimensional space. In particular, in surface deposition or in growth of aggregates or…
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
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…
Infinitely many particles of two types ("plus" and "minus") jump randomly along the one-dimensional lattice $\mathbf{Z}_{\varepsilon}=\varepsilon\mathbf{Z}$. Annihillations occur when two particles of different time occupy the same site.…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
In this paper we develop an encounter-based model of a run-and-tumble particle (RTP) confined to a finite interval $[0,L]$ with partially absorbing, sticky boundaries at both ends. We assume that the particle switches between two constant…
We investigate the stationary distribution of asymmetric and weakly asymmetric simple exclusion processes with open boundaries. We project the stationary distribution onto a subinterval, whose size is allowed to grow with the length of the…
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…