Related papers: Contact processes with random recovery rates and e…
We prove that the supercritical one-dimensional contact process survives in certain wedge-like space-time regions, and that when it survives it couples with the unrestricted contact process started from its upper invariant measure. As an…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
We show results for the contact process on Barabasi networks. The contact process is a model for an epidemic spreading without permanent immunity that has an absorbing state. For finite lattices, the absorbing state is the true stationary…
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…
In this article, we consider the basic contact process in a static random environment on the half space $Z^d\times Z^+$ where the recovery rates are constants and the infection rates are independent and identically distributed random…
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the…
This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs. We focus on the Gaussian model where the two graphs are complete graphs with correlated Gaussian weights and the…
Realistic modeling of ecological population dynamics requires spatially explicit descriptions that can take into account spatial heterogeneity as well as long-distance dispersal. Here, we present Monte Carlo simulations and numerical…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
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…
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 consider the fundamental problems of determining the rooted and global edge and vertex connectivities (and computing the corresponding cuts) in directed graphs. For rooted (and hence also global) edge connectivity with small integer…
We introduce a Reed-Frost epidemic model with recursive contact tracing and asymptomatic transmission. This generalizes the branching-process model introduced by the authors in a previous work [arxiv:2004.07237] to finite populations and…
Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erd\H{o}s-R\'{e}nyi graphs $G(n,\frac{d}{n})$.…
The epidemic process on a graph is considered for which infectious contacts occur at rate which depends on whether a susceptible is infected for the first time or not. We show that the Vasershtein coupling extends if and only if secondary…
Liggett and Steif (2006) proved that, for the supercritical contact process on certain graphs, the upper invariant measure stochastically dominates an i.i.d.\ Bernoulli product measure. In particular, they proved this for $\mathbb{Z}^d$ and…
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,…
A bootstrap percolation process on a graph G is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours…