Related papers: Competing bootstrap processes on the random graph …
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
We study the evolution of majority dynamics with more than two states on the binomial random graph $G(n,p)$. In this process, each vertex has a state in $\{1,\ldots, k\}$, with $k\geq 3$, and at each round every vertex adopts state $i$ if…
We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or blue say. Neighbouring vertices with different opinions…
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
The problem of competitive nucleation in the framework of Probabilistic Cellular Automata is studied from the dynamical point of view. The dependence of the metastability scenario on the self--interaction is discussed. An intermediate…
Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two…
The $r$-neighbour bootstrap percolation process on a graph $G$ starts with an initial set $A_0$ of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a…
In this paper we introduce a novel description of the equilibrium state of a bond percolation process on random graphs using the exact method of generating functions. This allows us to find the expected size of the giant connected component…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with type 1 and type 2 infection, respectively, and the infection…
An edge-coloring of a connected graph $G$ is called a {\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic path joining any two vertices of the graph $G$. Let $mc(G)$…
Consider a graph $G=(V,E)$ and a random initial vertex-coloring, where each vertex is blue independently with probability $p_{b}$, and red with probability $p_r=1-p_b$. In each step, all vertices change their current color synchronously to…
We study a graph-theoretic model of interface dynamics called $Competitive\, Erosion$. Each vertex of the graph is occupied by a particle, which can be either red or blue. New red and blue particles are emitted alternately from their…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
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…
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
We introduce a new model of correlated randomly growing graphs and study the fundamental questions of detecting correlation and estimating aspects of the correlated structure. The model is simple and starts with any model of randomly…
Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollob\'as in 1968. In this process, we start with initial "infected" set of edges $E_0$, and we infect new edges according to a predetermined rule. Given a graph…
Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…