Related papers: Dispersion processes
We consider a system of particles performing a discrete-time binary branching random walk with independent standard normal increments subject to a penalty $\b$ for every pair of particles that get within distance $\e$ of each other at every…
We study semi-infinite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction…
We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…
The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…
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…
In this work we study a kinetic model of active particles with delayed dynamics, and its limit when the number of particles goes to infinity. This limit turns out to be related to delayed differential equations with random initial…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
Most of the published articles on random motions have been devoted to the study of the telegraph process or its generalizations that describe the random motion in $R^n$ of a single particle in a Markov or semi-Markov medium. However, up to…
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…
We consider a branching random walk on $\mathbb{Z}$ started by $n$ particles at the origin, where each particle disperses according to a mean-zero random walk with bounded support and reproduces with mean number of offspring $1+\theta/n$.…
In this paper, we study the dynamics of a system of $n$ coupled, self-propelled particles: $\ddot r_k = (\alpha-\beta |\dot r_k|^2)\dot r_k - \frac{\gamma}{n}\sum_{m=1}^n(r_k-r_m)$, $r_k\in \mathbb R^2.$ Numerical experiments indicate that,…
We study the distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the…
Particle resuspension refers to the physical process by which solid particles deposited on a surface are, first, detached and, then, entrained away by the action of a fluid flow. In this study, we explore the dynamics of large and heavy…
Given an integer k, we consider the parallel k-stripping process applied to a hypergraph H: removing all vertices with degree less than k in each iteration until reaching the k-core of H. Take H as H_r(n,m): a random r-uniform hypergraph on…
We study the following bootstrap percolation process: given a connected graph $G$, a constant $\rho \in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a…
The $d$-process generates a graph at random by starting with an empty graph with $n$ vertices, then adding edges one at a time uniformly at random among all pairs of vertices which have degrees at most $d-1$ and are not mutually joined. We…
We investigate the motion of a suspended non-Brownian sphere past a fixed cylindrical or spherical obstacle in the limit of zero Reynolds number for arbitrary particle-obstacle aspect ratios. We consider both a suspended sphere moving in a…