Related papers: Phase transitions for chase-escape models on Gilbe…
The dynamics of the spread of contagions such as viruses, infectious diseases or even rumors/opinions over contact networks (graphs) have effectively been captured by the well known \textit{Susceptible-Infected-Susceptible} ($SIS$) epidemic…
The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within…
We study SIR type epidemics on graphs in two scenarios: (i) when the initial infections start from a well connected central region, (ii) when initial infections are distributed uniformly. Previously, \'Odor et al. demonstrated on a few…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
Human diseases spread over networks of contacts between individuals and a substantial body of recent research has focused on the dynamics of the spreading process. Here we examine a model of two competing diseases spreading over the same…
We study a susceptible-infected-removed (SIR) model with multiple seeds on a regular random graph. Many researchers have studied the epidemic threshold of epidemic models above which a global outbreak can occur, starting from an…
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a…
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…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
Models of threshold driven contagion explain the cascading spread of information, behavior, systemic risk, and epidemics on social, financial and biological networks. At odds with empirical observation, these models predict that…
The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…
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…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
We study the phase transition from the persistence phase to the extinction phase for the SIRS (susceptible/ infected/ refractory/ susceptible) model of diseases spreading on small world network. We show the effects of all the parameters…
We study infection spread among biased random walks on $\mathbb{Z}^{d}$. The random walks move independently and an infected particle is placed at the origin at time zero. Infection spreads instantaneously when particles share the same site…
We study a simple case of the susceptible-weakened-infected-removed model in regular random graphs in a situation where an epidemic starts from a finite fraction of initially infected nodes (seeds). Previous studies have shown that,…
This paper investigates a special variant of a pursuit-evasion game called lions and contamination. In a graph where all vertices are initially contaminated, a set of lions traverses the graph, clearing the contamination from every vertex…
We study a competitive stochastic growth model called chase-escape in which red particles spread to adjacent uncolored sites and blue only to adjacent red sites. Red particles are killed when blue occupies the same site. If blue has rate-1…
We introduce and analyze models for the propagation of malware in pure D2D networks given via stationary Cox-Gilbert graphs. Here, the devices form a Poisson point process with random intensity measure $\lambda\Lambda$, where $\Lambda$ is…