Related papers: A Metastability Result for the Contact Process on …
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…
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in…
We consider a random walk with catastrophes which was introduced to model population biology. It is known that this Markov chain gets eventually absorbed at $0$ for all parameter values. Recently, it has been shown that this chain exhibits…
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
Epidemic spreading is well understood when a disease propagates around a contact graph. In a stochastic susceptible-infected-susceptible setting, spectral conditions characterise whether the disease vanishes. However, modelling human…
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 present quasi-stationary simulations of the two-dimensional contact process with quenched disorder included through the random dilution of a fraction of the lattice sites (these sites are not susceptible to infection). Our results…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
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…
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…
The stacked contact process is a stochastic model for the spread of an infection within a population of hosts located on the $d$-dimensional integer lattice. Regardless of whether they are healthy or infected, hosts give birth and die at…
The contact process is a non-equilibrium Hamiltonian model that, even in one dimension, lacks an exact solution and has been extensively studied via Monte Carlo simulations, both in steady-state and time-dependent scenarios. Although the…
The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every vertex is a mutant, or "extinction", where no vertex is a…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
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 evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
In this paper we are concerned with contact process with random recovery rates on open clusters of bond percolation on $\mathbb{Z}^d$. Let $\xi$ be a positive random variable, then we assigned i. i. d. copies of $\xi$ on the vertices as the…
We study the phase transition phenomena for long-range oriented percolation and contact process. We studied a contact process in which the range of each vertex are independent, updated dynamically and given by some distribution $N$. We also…
We study the time that the simple exclusion process on the complete graph needs to reach equilibrium in terms of total variation distance. For the graph with n vertices and 1<<k<n/2 particles we show that the mixing time is of order…