Related papers: The contact process on the complete graph with ran…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
The contact process, or SIS epidemic, is a continuous-time Markov process used to model the spread of infection on a graph. Each vertex is either healthy or infected, and each infected vertex independently infects each of its healthy…
We study the supercritical contact process on Galton-Watson trees and periodic trees. We prove that if the contact process survives weakly then it dominates a supercritical Crump-Mode-Jagers branching process. Hence the number of infected…
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…
The basic contact process with parameter $\mu$ altered so that infections of sites that have not been previously infected occur at rate proportional to $\lambda$ instead is considered. Emergence of an infinite epidemic starting out from a…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…
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…
The contact process with an asymptomatic state, introduced in [Belhadji, Lanchier and Mercer, Stochastic Process. Appl., 176:104417, 2024], is a natural variant of the basic contact process that distinguishes between asymptomatic (state 1)…
In the multitype contact process, vertices of a graph can be empty or occupied by a type 1 or a type 2 individual; an individual of type $i$ dies with rate 1 and sends a descendant to a neighboring empty site with rate $\lambda_i$. We study…
We consider the contact process with infection rate $\lambda$ on $\mathbb{T}_n^d$, the $d$-ary tree of height $n$. We study the extinction time $\tau_{\mathbb{T}_n^d}$, that is, the random time it takes for the infection to disappear when…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…
We show that a certain model for the spread of an infection has a phase transition in the recuperation rate. The model is as follows: There are particles or individuals of type A and type B, interpreted as healthy and infected,…
We consider a stochastic model of infection spread on the complete graph on $N$ vertices incorporating dynamic partnerships, which we assume to be monogamous. This can be seen as a variation on the contact process in which some form of edge…
We study the extinction time $\uptau$ of the contact process on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on $\Z$, then, uniformly over all trees of degree…
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 consider the contact process on the preferential attachment graph. The work of Berger, Borgs, Chayes and Saberi [BBCS1] confirmed physicists predictions that the contact process starting from a typical vertex becomes endemic for an…
This paper is a further study of Reference \cite{Xue2015}. We are concerned with the contact process with random vertex weights on the oriented lattice. Our main result gives the asymptotic behavior of the survival probability of the…
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 each uninfected node which has at least $r$ infected neighbours…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We show results for the contact process on Barabasi networks. The contact process is a model for an epidemic spreading without permanent immunity that has an absorbing state. For finite lattices, the absorbing state is the true stationary…