Related papers: A phase transition for a spatial host-parasite mod…

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.…

The behavior of two interacting populations, ``hosts''and ``parasites'', is investigated on Cayley trees and scale-free networks. In the former case analytical and numerical arguments elucidate a phase diagram, whose most interesting…

To investigate interactions between parasite species in a host, a population of field voles was studied longitudinally, with presence or absence of six different parasites measured repeatedly. Although trapping sessions were regular, a…

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase…

Cyclic predator-prey models with four or six species are studied on a square lattice when the invasion rates are varied. It is found that the cyclic invasions maintain a self-organizing pattern as long as the deviation of the invasion…

Emerging marine infectious diseases pose a substantial threat to marine ecosystems and the conservation of their biodiversity. Compartmental models of epidemic transmission in marine sessile organisms, available only recently, are based on…

We study a generalization of the classical contact process (SIS epidemic model) in a directed graph $G$. Our model is a continuous-time interacting particle system in which at every time, each vertex is either healthy or infected, and each…

We consider a system of interacting random walks known as the frog model. Let $\mathcal{K}_n=(\mathcal{V}_n,\mathcal{E}_n)$ be the complete graph with $n$ vertices and $o\in\mathcal{V}_n$ be a special vertex called the root. Initially,…

We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…

In this paper we study threshold-one contact processes on lattices and regular trees. The asymptotic behavior of the critical infection rates as the degrees of the graphs growing to infinity are obtained. Defining \lambda_c as the supremum…

We numerically investigate the six-species predator-prey game in complex networks as well as in $d$-dimensional hypercubic lattices with $d=1,2,..., 6$. The interaction topology of the six species contains two loops, each of which is…

We study the frog model on \( \mathbb{Z} \) with geometric lifetimes, introducing a random survival parameter. Active and inactive particles are placed at the vertices of \( \mathbb{Z} \). The lifetime of each active particle follows a…

Stochastic infection processes are continuous-time Markov chains on graphs that assign each vertex one of multiple states, such as susceptible, infected, or recovered. Depending on the model, vertices change their state based on random…

We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…

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 a spatial stochastic model for a pathogen population growing inside a host that attempts to eliminate the pathogens through its immune system. The pathogen population is divided into different types. A pathogen can either…

It has been conjectured that the critical density of the Activated Random Walk model is strictly less than one for any value of the sleeping rate. We prove this conjecture on $\mathbb{Z}^d$ when $d \geq 3$ and, more generally, on graphs…

We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…

We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…

In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…