Related papers: The contact process with semi-infected state on th…
The epidemic process on a graph is considered for which infectious contacts occur at rate which depends on whether a susceptible is infected for the first time or not. We show that the Vasershtein coupling extends if and only if secondary…
For a graph $H$ whose edges are coloured blue or red, the $H$-semi-inducibility problem asks for the maximum, over all graphs $G$ of given order $n$, of the number of injections from the vertex set of $H$ into the vertex set of $G$ that…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing…
We study a two-level contact process. We think of fleas living on a species of animals. The animals are a supercritical contact process in $\mathbb{Z}^d$. The contact process acts as the random environment for the fleas. The fleas do not…
The susceptible-exposed-infectious-susceptible (SEIS) model is well-known in mathematical epidemiology as a model of infection in which there is a latent period between the moment of infection and the onset of infectiousness. The…
The stacked contact process is a three-state spin system that describes the co-evolution of a population of hosts together with their symbionts. In a nutshell, the hosts evolve according to a contact process while the symbionts evolve…
In this paper we study a discrete-time SIS (susceptible-infected-susceptible) model, where the infection and healing parameters and the underlying network may change over time. We provide conditions for the model to be well-defined and…
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 consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors. A \emph{contagious set} is a set…
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…
We give a construction of a tree in which the contact process with any positive infection rate survives but, if a certain privileged edge $e^*$ is removed, one obtains two subtrees in which the contact process with infection rate smaller…
We investigate a modified one-dimensional contact process with varying infection rates. Specifically, the infection spreads at rate $\lambda_e$ along the boundaries of the infected region and at rate $\lambda_i$ elsewhere. We establish the…
We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…
We study a system of simple random walks on $\mathcal{T}_{d,n} = \mathcal{V}_{d,n}, \mathcal{E}_{d,n})$, the $d$-ary tree of depth $n$, known as the frog model. Initially there are Pois($\lambda$) particles at each site, independently, with…
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 consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
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 study a one-dimensional contact process with two infection parameters, one giving the infection rates at the boundaries of a finite infected region and the other one the rates within that region. We prove that the critical value of each…
Infectious diseases spread through human networks. Susceptible-Infected-Removed (SIR) model is one of the epidemic models to describe infection dynamics on a complex network connecting individuals. In the metapopulation SIR model, each node…