Related papers: A Model for the Multi-Virus Contact Process
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
We study the contact process in the regime of small infection rates on finite scale-free networks with stationary dynamics based on simultaneous updating of all connections of a vertex. We allow the update rates of individual vertices to…
In this paper we are concerned with the SIR (Susceptible-Infective-Removed) epidemic on open clusters of bond percolation on the squared lattice. For the SIR model, a susceptible vertex is infected at rate proportional to the number of…
We consider a Spatial Markov Chain model for the spread of viruses. The model is based on the principle to represent a graph connecting nodes, which represent humans. The vertices between the nodes represent relations between humans. In…
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 study a contact process running in a random environment in $\mathbb {Z}^d$ where sites flip, independently of each other, between blocking and nonblocking states, and the contact process is restricted to live in the space given by…
We consider an interacting particle process on a graph which, from a macroscopic point of view, looks like $\Z^d$ and, at a microscopic level, is a complete graph of degree $N$ (called a patch). There are two birth rates: an inter-patch one…
The constant rate birth--death process is a popular null model for speciation and extinction. If one removes extinct and non-sampled lineages, this process induces `reconstructed trees' which describe the relationship between extant…
The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of…
Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…
We analyze variants of the contact process that are built by modifying the percolative structure given by the graphical construction and develop a robust renormalization argument for proving extinction in such models. With this method, we…
The existence of a weak survival region is established for the anisotropic symmetric contact process on a homogeneous tree T_{2d} of degree 2d > 2: For parameter values in a certain connected region of positive Lebesgue measure, the…
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant…
We couple a multi-type stochastic epidemic process with a directed random graph, where edges have random lengths. This random graph representation is used to characterise the fractions of individuals infected by the different types of…
For rapidly spreading diseases where many cases show no symptoms, swift and effective contact tracing is essential. While exposure notification applications provide alerts on potential exposures, a fully automated system is needed to track…
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most $k$ edges from a given input graph (of small treewidth) so that the resulting graph avoids a set…
We consider a non-attractive three state contact process on $\mathbb Z$ and prove that there exists a regime of survival as well as a regime of extinction. In more detail, the process can be regarded as an infection process in a dynamic…
Previous work has shown that for contagion processes on extended star networks (trees with exactly one node of degree > 2), there is a simple, closed-form expression for a highly accurate approximation to the maximum likelihood infection…
Minimum spanning trees (MSTs) are used in a variety of fields, from computer science to geography. Infectious disease researchers have used them to infer the transmission pathway of certain pathogens. However, these are often the MSTs of…