Related papers: The contact process over a dynamical d-regular gra…
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 investigate the contact process on scale-free networks evolving by a stationary dynamics whereby each vertex independently updates its connections with a rate depending on its power. This rate can be slowed down or speeded up by virtue…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
Source detection (SD) is the task of finding the origin of a spreading process in a network. Algorithms for SD help us combat diseases, misinformation, pollution, and more, and have been studied by physicians, physicists, sociologists, and…
We consider the contact process on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law with exponent $\chi \in(1,2)$ (so that the degree distribution has finite mean and infinite second…
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 contact process with semi-infected state on the complete graph $C_n$ with $n$ vertices. In our model, each vertex is in one of three states that `healthy', `semi-infected' or `wholly-infected'. Only…
Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process…
We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…
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 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…
We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…
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…
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 consider contact processes on the hierarchical group, where sites infect other sites at a rate depending on their hierarchical distance, and sites become healthy with a constant recovery rate. If the infection rates decay too fast as a…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
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 consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…
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…