Related papers: The contact process over a dynamical d-regular gra…
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…
The quadratic contact process (QCP) is a natural extension of the well studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate $\lambda$ and infected individuals recover ($1 \longrightarrow 0$)…
We present a modified diffusive epidemic process that has a finite threshold on scale-free graphs. The diffusive epidemic process describes the epidemic spreading in a non-sedentary population, and it is a reaction-diffusion process. In the…
In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with $n$ vertices. We show that the model has a critical value which is inversely proportional to the product of the mean…
We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…
We introduce a Reed-Frost epidemic model with recursive contact tracing and asymptomatic transmission. This generalizes the branching-process model introduced by the authors in a previous work [arxiv:2004.07237] to finite populations and…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We study a two dimensional version of Neuhauser's long range sexual reproduction model and prove results that give bounds on the critical values $\lambda_f$ for the process to survive from a finite set and $\lambda_e$ for the existence of a…
The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the…
Consider a network of $n$ single-server queues where tasks arrive independently at each server at rate $\lambda_n$. The servers are connected by a graph that is resampled at rate $\mu_n$ in a way that is symmetric with respect to the…
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…
We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…
We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We propose a new perspective on the asymptotic regimes of fast and slow extinction in the contact process on locally converging sequences of sparse finite graphs. We characterise the phase boundary by the existence of a metastable density,…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
The epidemic process on a graph is considered for which infectious contacts occur at rate which depends on whether a susceptible is infected for the first time or not. We show that the Vasershtein coupling extends if and only if secondary…
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…
In this paper we introduce the optimal control of a kinetic model describing agents who migrate on a graph and interact within its nodes exchanging a physical quantity. As a prototype model, we consider the spread of an infectious disease…
The spread of an infection, a contagion, meme, emotion, message and various other spreadable objects have been discussed in several works. Burning and firefighting have been discussed in particular on static graphs. Graph burning simulates…