Related papers: Long-range competition on the torus
2-boostrap percolation on a graph is a diffusion process where a vertex gets infected whenever it has at least 2 infected neighbours, and then stays infected forever. It has been much studied on the infinite grid for random Bernoulli…
A spreading process on a network is influenced by the network's underlying spatial structure, and it is insightful to study the extent to which a spreading process follows such structure. We consider a threshold contagion model on a network…
The emergence or adaptation of pathogens may lead to epidemics, highlighting the need for a thorough understanding of pathogen evolution. The tradeoff hypothesis suggests that virulence evolves to reach an optimal transmission intensity…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…
We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of an SIR type model studied by us recently in mean field…
In this paper we are concerned with contact processes with random vertex weights on oriented lattices. In our model, we assume that each vertex x of Z^d takes i. i. d. positive random value \rho(x). Vertex y infects vertex x at rate…
This paper investigates a special variant of a pursuit-evasion game called lions and contamination. In a graph where all vertices are initially contaminated, a set of lions traverses the graph, clearing the contamination from every vertex…
The two-type Richardson model describes the growth of two competing infections on $\mathbb{Z}^d$. At time 0 two disjoint finite sets $\xi_1,\xi_2\subset \mathbb{Z}^d$ are infected with type 1 and type 2 infection respectively. An uninfected…
We investigate a model of a parasite population invading spatially distributed immobile hosts on a graph, which is a modification of the frog model. Each host has an unbreakable immunity against infection with a certain probability $1-p$…
We investigate a non-Markovian analogue of the Harris contact process in a finite connected graph G=(V,E): an individual is attached to each site x in V, and it can be infected or healthy; the infection propagates to healthy neighbors just…
We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many…
Epidemic processes are used commonly for modeling and analysis of biological networks, computer networks, and human contact networks. The idea of competing viruses has been explored recently, motivated by the spread of different ideas along…
An Euclidean first-passage percolation (FPP) model describing the competing growth between $k$ different types of infection is considered. We focus on the long time behavior of this multi-type growth process and we derive multi-type shape…
We explore the emergence of persistent infection in a patch of population, where the disease progression of the individuals is given by the SIRS model and an individual becomes infected on contact with another infected individual. We…
We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage…
This paper studies a distributed continuous-time bi-virus model in which two competing viruses spread over a network consisting of multiple groups of individuals. Limiting behaviors of the network are characterized by analyzing the…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer…
We consider a two-type stochastic competition model on the integer lattice Z^d. The model describes the space evolution of two ``species'' competing for territory along their boundaries. Each site of the space may contain only one…