Related papers: The Williams Bjerknes Model on Regular Trees
In this paper we are concerned with contact processes with random edge weights on rooted regular trees. We assign i.i.d weights on each edge on the tree and assume that an infected vertex infects its healthy neighbor at rate proportional to…
We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $\alpha$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the…
Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Frob\"ose, upper bounds are sharp to…
We study the contact process on the complete graph on $n$ vertices where the rate at which the infection travels along the edge connecting vertices $i$ and $j$ is equal to $ \lambda w_i w_j / n$ for some $\lambda >0$, where $w_i$ are i.i.d.…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous time simple random walk on the d-dimensional lattice. These particles are called A-particles and move independently…
We study a discrete Susceptible-Infected-Recovered (SIR) model for the spread of infectious disease on a homogeneous tree and the limit behavior of the model in the case when the tree vertex degree tends to infinity. We obtain the…
In this paper we are concerned with the SIR model with random vertex weights on Erd\H{o}s-R\'{e}nyi graph $G(n,p)$. The Erd\H{o}s-R\'{e}nyi graph $G(n,p)$ is generated from the complete graph $C_n$ with $n$ vertices through independently…
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…
Bootstrap percolation on a graph with infection threshold $r\in \mathbb{N}$ is an infection process, which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes…
Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…
We investigate a fermionic susceptible-infected-susceptible model with mobility of infected individuals on uncorrelated scale-free networks with power-law degree distributions $P (k) \sim k^{-\gamma}$ of exponents $2<\gamma<3$. Two…
We study competition between two growth models with long-range correlations on the torus $\mathbb T_n^d$ of size $n$ in dimension $d$. We append the edge set of the torus $\mathbb T_n^d$ by including all non-nearest-neighbour edges, and…
A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight…
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…
In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed their choice have a latent period, which is exponential with rate $\lambda$, during which they will not buy a new…
A Reed-Frost epidemic with inhomogeneous infection probabilities on a graph with prescribed degree distribution is studied. Each edge $(u,v)$ in the graph is equipped with two weights $W_{(u,v)}$ and $W_{(v,u)}$ that represent the…
The boundary modified contact process models an epidemic spreading in one dimension with two infection parameters, $\lambda_i$ and $\lambda_e$. Starting from a finite infected set, each edge of $\mathbb{Z}$ transmits the infection at rate…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…
We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently…
We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube…