Related papers: A Metastability Result for the Contact Process on …
We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…
Epidemic outbreaks of new pathogens, or known pathogens in new populations, cause a great deal of fear because they are hard to predict. For theoretical models of disease spreading, on the other hand, quantities characterizing the outbreak…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
We performed Monte Carlo simulations of the symbiotic contact process on different spatial dimensions ($d$). On the complete and random graphs (infinite dimension), we observe hysteresis cycles and bistable regions, what is consistent with…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the…
Understanding the spread of diseases through complex networks is of great interest where realistic, heterogeneous contact patterns play a crucial role in the spread. Most works have focused on mean-field behavior -- quantifying how contact…
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…
In order to understand the cost of a potentially high infectiousness of symptomatic individuals or, on the contrary, the benefit of social distancing, quarantine, etc. in the course of an infectious disease, this paper considers a natural…
This note gives an exponential tail approximation for the extinction time of a subcritical multitype branching process arising from the SIR epidemic model on a random graph with given degrees, where the type corresponds to the vertex…
We propose the following model for speciation and extinction. Birth and deaths occur according to spatially inhomogeneous contact rates. We assume that the ratio of the birth rate over the death rate at a site converges to some limit as the…
The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole…
In numerous papers, the behaviour of stochastic population models is investigated through the sign of a real quantity which is the growth rate of the population near the extinction set. In many cases, it is proven that when this growth rate…
The dynamical mechanisms that can stabilize the coexistence of species (or strategies) are of substantial interest for the maintenance of biodiversity and in sociobehavioural dynamics. We investigate the mean extinction time in the…
We consider the first exit time of a nonnegative Harris-recurrent Markov process from the interval $[0,A]$ as $A\to\infty$. We provide an alternative method of proof of asymptotic exponentiality of the first exit time (suitably…
We study the effect of metastable states on the relaxation process (and hence information propagation) in locally coupled and boundary-driven structures. We first give a general argument to show that metastable states are inevitable even in…
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…
We study the evolution of strictly mean-convex entire graphs over $R^n$ by Inverse Mean Curvature flow. First we establish the global existence of starshaped entire graphs with superlinear growth at infinity. The main result in this work…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…