Related papers: The Williams Bjerknes Model on Regular Trees
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
The frog model is an infection process in which dormant particles begin moving and infecting others once they become infected. We show that on the rooted $d$-ary tree with particle density $\Omega(d^2)$, the set of visited sites contains a…
The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing…
The Jordan center of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detection problems. We study properties of the Jordan Center in the…
We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
This paper is a further study of Reference \cite{Xue2015}. We are concerned with the contact process with random vertex weights on the oriented lattice. Our main result gives the asymptotic behavior of the survival probability of the…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We study two famous interacting particle systems, the so-called Richardson's model and the contact process, when we add a stirring dynamics to them. We prove that they both satisfy an asymptotic shape theorem, as their analogues without…
We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…
We are interested in the geometry of the ``infection tree'' in a stochastic SIR (Susceptible-Infectious-Recovered) model, starting with a single infectious individual. This tree is constructed by drawing an edge between two individuals when…
We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on Barab\'asi-Albert (BA),…
The Norros-Reittu model is a random graph with $n$ vertices and i.i.d. weights assigned to them. The number of edges between any two vertices follows an independent Poisson distribution whose parameter is increasing in the weights of the…
In this paper we describe the dynamics of a vector-borne relapsing disease, such as tick-borne relapsing fever, using the methods of compartmental models. After some motivation, model description, and a brief overview of the theory of…
We study atypical behavior in bootstrap percolation on the Erd\H{o}s-R\'enyi random graph. Initially a set $S$ is infected. Other vertices are infected once at least $r$ of their neighbors become infected. Janson et al. (2012) locates the…
Consider the following stochastic model for immune response. Each pathogen gives birth to a new pathogen at rate $\lambda$. When a new pathogen is born, it has the same type as its parent with probability $1 - r$. With probability $r$, a…
The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…
We study the asymptotic behavior of the maximum degree in the evolving tree model with a choice based on both degree and fitness of a vertex. The tree is constructed in the following recursive way. Each vertex is assigned a parameter to it…
We investigate a class of growing graphs embedded into the $d$-dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on…