Related papers: The contact process on dynamic regular graphs: mon…
Spreading from a seed is studied by Monte Carlo simulation on a square lattice with two types of sites affecting the rates of birth and death. These systems exhibit a critical transition between survival and extinction. For time- dependent…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
Disease spread in most biological populations requires the proximity of agents. In populations where the individuals have spatial mobility, the contact graph is generated by the "collision dynamics" of the agents, and thus the evolution of…
In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…
In this paper we study long-term evolution of a finite system of locally interacting birth-and-death processes labelled by vertices of a finite connected graph. A detailed description of the asymptotic behaviour is obtained in the case of…
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…
The three state contact process is the modification of the contact process at rate $\mu$ in which first infections occur at rate $\lambda$ instead. Chapters 2 and 3 consider the three state contact process on (graphs that have as set of…
Spreading processes on graphs are a natural model for a wide variety of real-world phenomena, including information spread over social networks and biological diseases spreading over contact networks. Often, the networks over which these…
We consider an SIR-type (Susceptible $\to$ Infected $\to$ Recovered) stochastic epidemic process with multiple modes of transmission on a contact network. The network is given by a random graph following a multilayer configuration model…
In this paper we are concerned with the two-stage contact process on the lattice $\mathbb{Z}^d$ introduced in \cite{Krone1999}. We gives a limit theorem of the critical infection rate of the process as the dimension $d$ of the lattice grows…
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 contact process with stirring on $\mathbb{Z}^d$. In this process, particles occupy vertices of $\mathbb{Z}^d$; each particle dies with rate 1 and generates a new particle at a randomly chosen neighboring vertex with rate…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of $k$ initially infected individuals. We formalise this problem as the Temporal Reachability Dominating…
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 present a contact-based model to study the spreading of epidemics by means of extending the dynamic message passing approach to temporal networks. The shift in perspective from node- to edge-centric quantities enables accurate modelling…
We explore how heterogeneity in the intensity of interactions between people affects epidemic spreading. For that, we study the susceptible-infected-susceptible model on a complex network, where a link connecting individuals $i$ and $j$ is…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
Consider an SI process on a graph $G$ where each S--I connection becomes I--I at rate $\lambda$. Here S and I stand for ``susceptible'' and ``infected'' respectively. The evoSI model is a modification of the SI model in which S--I edges are…