Related papers: Long-range competition on the torus
Let $X$ be a random walk on the torus of side length $N$ in dimension $d\geq 3$ with uniform starting point, and $t_{\text{cov}}$ be the expected value of its cover time, which is the first time that $X$ has visited every vertex of the…
The possibility of coexistence of two competing populations is a classical question which dates back to the earliest `predator-prey' models. In this paper we study this question in the context of a model for the spread of a virus infection…
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…
We study the SIRS process, a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each infected vertex becomes recovered at rate 1 and infects each…
We investigate the dynamics of dual disease epidemics within the spatial rock-paper-scissors model. In this framework, individuals from all species are equally susceptible to infection by two distinct pathogens transmitted via…
This is a continuation of our work \cite{dns-part1} to investigate the long-time dynamics of a two species competition model of Lotka-Volterra type with nonlocal diffusions, where the territory (represented by the real line $\R$) of a…
We introduce and study an interacting particle system evolving on the $d$-dimensional torus $(\mathbb Z/N\mathbb Z)^d$. Each vertex of the torus can be either empty or occupied by an individual of type $\lambda \in (0,\infty)$. An…
We analyze the Susceptible-Infected-Recovered-Susceptible (SIRS) process, a continuous-time Markov chain frequently employed in epidemiology to model the spread of infections on networks. In this framework, infections spread as infected…
We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…
The epidemic spreading has been widely studied when each node may get infected by an infected neighbor with the same rate. However, the infection rate between a pair of nodes is usually heterogeneous and even correlated with their nodal…
We present results on phase transitions of local and global survival in a two-species model on Gilbert graphs. At initial time there is an infection at the origin that propagates on the Gilbert graph according to a continuous-time…
The SIRS process is a continuous-time process for how infections spread on a graph. In this model, each vertex is in one of the following three states: susceptible (to the infection; S), infected (I), or recovered (R) and thus immune to the…
We study the macroscopic geometry of first-passage competition on the integer lattice $Z^d$, with a particular interest in describing the behavior when one species initially occupies the exterior of a cone. First-passage competition is a…
We use a deterministic model to study two competing viruses spreading over a two-layer network in the Susceptible--Infected--Susceptible (SIS) framework, and address a central problem of identifying the winning virus in a…
We study a discrete Susceptible-Infected-Recovered (SIR) model for the spread of infectious disease on a homogeneous tree and the limit behavior of the model in the case when the tree vertex degree tends to infinity. We obtain the…
In this paper we consider the diffusive competition model consisting of an invasive species with density $u$ and a native species with density $v$, in a radially symmetric setting with free boundary. We assume that $v$ undergoes diffusion…
We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…
A bootstrap percolation process on a graph with infection threshold $r\ge 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex…
We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…