Related papers: A Model for the Multi-Virus Contact Process
We consider a spatial stochastic model for a pathogen population growing inside a host that attempts to eliminate the pathogens through its immune system. The pathogen population is divided into different types. A pathogen can either…
We study the contact process running in the one-dimensional lattice undergoing dynamical percolation, where edges open at rate $vp$ and close at rate $v(1-p)$. Our goal is to explore how the speed of the environment, $v$, affects the…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…
We consider an SIS-type epidemic process that evolves on a known graph. We assume that a fixed curing budget can be allocated at each instant to the nodes of the graph, towards the objective of minimizing the expected extinction time of the…
The boundary modified contact process models an epidemic spreading in one dimension with two infection parameters, $\lambda_i$ and $\lambda_e$. Starting from a finite infected set, each edge of $\mathbb{Z}$ transmits the infection at rate…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…
This paper is concerned with a natural variant of the contact process modeling the spread of knowledge on the integer lattice. Each site is characterized by its knowledge, measured by a real number ranging from 0 = ignorant to 1 =…
We consider a two-type contact process on $\Z$ in which both types have equal finite range and supercritical infection rate. We show that a given type becomes extinct with probability 1 if and only if, in the initial configuration, it is…
An accurate approximate formula of the die-out probability in a SIS epidemic process on a network is proposed. The formula contains only three essential parameters: the largest eigenvalue of the adjacency matrix of the network, 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…
Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible-infected-susceptible setting, spectral conditions characterise whether the disease vanishes. However, modelling human…
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…
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 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…
In this paper we introduce a contact process on a dynamical long range percolation (CPDLP) defined on a complete graph $(V,\mathcal{E})$. A dynamical long range percolation is a Feller process defined on the edge set $\mathcal{E}$, which…
This paper develops and analyzes optimization models for rapid detection of viruses in large contact networks. In the model, a virus spreads in a stochastic manner over an undirected connected graph, under various assumptions on the spread…
We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…
Consider a birth and death chain to model the number of types of a given virus. Each type gives birth to a new type at rate $\lambda$ and dies at rate 1. Each type is also assigned a fitness. When a death occurs either the least fit type…
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…