Related papers: Dispersion processes
Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…
We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on $N$ vertices. The processes are allowed to spread with different rates, start from vertex subsets of different…
We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…
A class of generalized exclusion processes parametrized by the maximal occupancy, $k\geq 1$, is investigated. For these processes with symmetric nearest-neighbor hopping, we compute the diffusion coefficient and show that it is independent…
Let X be a critical branching L{\'e}vy process whose offspring distribution is in the domain of attraction of a stable random variable. We study the tail probability of the maximum location ever reached by a particle in two different…
We study the mixing time of the unit-rate zero-range process on the complete graph, in the regime where the number $n$ of sites tends to infinity while the density of particles per site stabilizes to some limit $\rho>0$. We prove that the…
The kinetics of the annihilation process, $A+A\to 0$, with ballistic particle motion is investigated when the distribution of particle velocities is {\it discrete}. This discreteness is the source of many intriguing phenomena. In the mean…
In the simplest model of single-file diffusion, $N$ point particles wander on a segment of the $x$ axis of length $L$, with hard core interactions, which prevent passing, and with overdamped Brownian dynamics, $\lambda\dot{x}=\eta(t)$,…
We study an inhomogeneous sparse random graph on [N] = {1, . . . , N } as introduced in a seminal paper by Bollobas, Janson and Riordan (2007): vertices have a type (here in a compact metric space S), and edges between different vertices…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
We use Stokesian Dynamics simulations to study the microscopic motion of particles suspended in fluids passing through porous media. We construct model porous media with fixed spherical particles, and allow mobile ones to move through this…
We consider a continuous-time symmetric branching random walk on multidimensional lattices with immigration and infinite number of initial particles. We assume that at every lattice point a process of birth and death of particles is…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
The diffusion in two dimensions of non-interacting active particles that follow an arbitrary motility pattern is considered for analysis. Accordingly, the transport equation is generalized to take into account an arbitrary distribution of…
We investigate the work fluctuations in an overdamped non-equilibrium process that is stopped at a stochastic time. The latter is characterized by a first passage event that marks the completion of the non-equilibrium process. In…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
A microscopic, stochastic, minimal model for collective and cohesive motion of identical self-propelled particles is introduced. Even though the particles interact strictly locally in a very noisy manner, we show that cohesion can be…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…