Related papers: Contact processes with random vertex weights on or…
In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…
Understanding spreading dynamics will benefit society as a whole in better preventing and controlling diseases, as well as facilitating the socially responsible information while depressing destructive rumors. In network-based spreading…
We refine previous results concerning the Renewal Contact Processes. We significantly widen the family of distributions for the interarrival times for which the critical value can be shown to be strictly positive. The result now holds for…
This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…
In this paper we introduce a contact process in an evolving random environment (CPERE) on a connected and transitive graph with bounded degree, where we assume that this environment is described through an ergodic spin systems with finite…
We study the limiting behavior of an interacting particle system evolving on the lattice $Z^{d}$ for $d\ge 3$. The model is known as the contact process with rapid stirring. The process starts with a single particle at the origin. Each…
Contact processes describe the transmission of distinct properties of nodes via the links of a network. They provide a simple framework for many phenomena, such as epidemic spreading and opinion formation. Combining contact processes with…
The contact model for the spread of disease may be viewed as a directed percolation model on $\ZZ \times \RR$ in which the continuum axis is oriented in the direction of increasing time. Techniques from percolation have enabled a fairly…
The contact process with an asymptomatic state, introduced in [Belhadji, Lanchier and Mercer, Stochastic Process. Appl., 176:104417, 2024], is a natural variant of the basic contact process that distinguishes between asymptomatic (state 1)…
We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1…
We are concerned with the supercritical contact process modified so that first infection occurs at a lower rate, it is known that the process survives with positive probability. Regarding the rightmost infected of the process started from…
We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…
This paper gives a new, simple proof of the known fact that for contact processes on general lattices, in the subcritical regime the expected number of infected sites decays exponentially fast as time tends to infinity. The proof also…
We consider the East model in $\mathbb Z^d$, an example of a kinetically constrained interacting particle system with oriented constraints, together with one of its natural variant. Under any ergodic boundary condition it is known that the…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We describe a model for $m$ vertex reinforced interacting random walks on complete graphs with $d\geq 2$ vertices. The transition probability of a random walk to a given vertex depends exponentially on the proportion of visits made by all…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the…