Related papers: Dispersion processes
The more we learn about the cytoplasm of cells, the more we realise that the cytoplasm is not uniform but instead is highly inhomogeneous. In any inhomogeneous solution, there are concentration gradients, and particles move either up or…
We consider a model where an infection moves through a collection of particles performing independent random walks. In this model, Kesten and Sidoravicius established linear growth of the infected region when infected and susceptible…
Particles moving along curved trajectories will diffuse if the curvature fluctuates sufficiently in either magnitude or orientation. We consider particles moving at a constant speed with either a fixed or with a Gaussian distributed…
We consider the behaviour of branching-selection particle systems in the large population limit. The dynamics of these systems is the combination of the following three components: (a) Motion: particles move on the real line according to a…
We study a discrete-time resource flow in $Z^d$, where wealthier vertices attract the resources of their less rich neighbors. For any translation-invariant probability distribution of initial resource quantities, we prove that the flow at…
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. As…
We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…
Dilute granular flows are routinely described by collisional kinetic theory, but dense flows require a fundamentally different approach, due to long-lasting, many-body contacts. In the case of silo drainage, many continuum models have been…
Of stochastic differential equations, diffusion processes have been adopted in numerous applications, as more relevant and flexible models. This paper studies diffusion processes in a different setting, where for a given stationary…
We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not…
In this article, we study a type of a one dimensional percolation model whose basic features include a sequential dropping of particles on a substrate followed by their transport via a pushing mechanism (see [S. N. Majumdar and D. S. Dean,…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
This paper investigates the position (state) distribution of the single step binomial (multi-nomial) process on a discrete state / time grid under the assumption that the velocity process rather than the state process is Markovian. In this…
A branching process of particles moving at finite velocity over the geodesic lines of the hyperbolic space (Poincar\'e half-plane and Poincar\'e disk) is examined. Each particle can split into two particles only once at Poisson paced times…
We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New particles appear subject to a neighbourhood exclusion…
A diffusion taking value in probability measures on a graph with a vertex set $V$, $\sum_{i\in V}x_i\delta_i$, is studied. The masses on each vertices satisfy the stochastic differential equation of the form $dx_i=\sum_{j\in…
We investigate the diffusive motion of an overdamped classical particle in a 1D random potential using the mean first-passage time formalism and demonstrate the efficiency of this method in the investigation of the large-time dynamics of…
We prove the convergence of the law of grid-valued random walks, which can be seen as time-space Markov chains, to the law of a general diffusion process. This includes processes with sticky features, reflecting or absorbing boundaries and…
We study the popular randomized rumour spreading protocol Push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round, each informed node chooses uniformly at random one of its…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…