Related papers: Border aggregation model
A one-dimensional model on a line of the length L is investigated, which involves particle diffusion as well as single particle annihilation. There are also creation and annihilation at the boundaries. The static and dynamical behaviors of…
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…
We introduce a model of self-propelled particles carrying out a Brownian motion with a diffusion coefficient which depends on the local density of particles within a certain finite radius. Numerical simulations show that in a range of…
We give a general existence and convergence result for interacting particle systems on locally finite graphs with possibly unbounded degrees or jump rates. We allow the local state space to be Polish, and the jumps at a site to affect the…
We introduce a graph-theoretic vertex dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. Begin with a complete graph on $n$ vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is…
We consider a model of fragmentation of sheet by cracks that move with a velocity in preferred direction, but undergo random transverse displacements as they move. There is a non-zero probability of crack-splitting, and the split cracks…
In this work we study a branching particle system of diffusion processes on the real line interacting through their rank in the system. Namely, each particle follows an independent Brownian motion, but only K $\ge$ 1 particles on the far…
In this paper we consider a model of particles jumping on a row of cells, called in physics the one dimensional totally asymmetric exclusion process (TASEP). More precisely we deal with the TASEP with open or periodic boundary conditions…
We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
The one-dimensional symmetric exclusion process, the simplest interacting particle process, is a lattice-gas made of particles that hop symmetrically on a discrete line respecting hard-core exclusion. The system is prepared on the infinite…
We study theoretically the erosion threshold of a granular bed forced by a viscous fluid. We first introduce a novel model of interacting particles driven on a rough substrate. It predicts a continuous transition at some threshold forcing…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
A random planar quadrangulation process is introduced as an approximation for certain cellular automata in terms of random growth of rays from a given set of points. This model turns out to be a particular (rectangular) case of the…
We study the shape of the outer envelope of a branching Brownian motion (BBM) in $\mathbb{R}^d$, $d\geq 2$. We focus on the extremal particles: those whose norm is within $O(1)$ of the maximal norm amongst the particles alive at time $t$.…