Related papers: The contact process on random hyperbolic graphs: m…
We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
In this work, we analyse the metastability of non-reversible diffusion processes $$dX_t=\boldsymbol{b}(X_t)dt+\sqrt h\,dB_t$$ on a bounded domain $\Omega$ when $\mathbf{b}$ admits the decomposition $\mathbf{b}=-(\nabla f+\mathbf{\ell})$ and…
We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New particles appear subject to a neighbourhood exclusion…
What is the long-time behavior of the law of a contact process started with a single infected site, distributed according to counting measure on the lattice? This question is related to the configuration as seen from a typical infected site…
Inspired by the recent viral epidemic outbreak and its consequent worldwide pandemic, we devise a model to capture the dynamics and the universality of the spread of such infectious diseases. The transition from a pre-critical to the…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in ${G}$ have polynomial volume growth with growth…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We introduce a dynamic random hypergraph model constructed from a bipartite graph. In this model, both vertex sets of the bipartite graph are generated by marked Poisson point processes. Vertices of both vertex sets are equipped with marks…
We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…
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 study a model that generalizes the CP with diffusion. An additional transition is included in the model so that at a particular point of its phase diagram a crossover from the directed percolation to the compact directed percolation…
We study the stationary properties of the two-dimensional pair contact process, a nonequilibrium lattice model exhibiting a phase transition to an absorbing state with an infinite number of configurations. The critical probability and…
The contact process on an infinite homogeneous tree is shown to exhibit at least two phase transitions as the infection parameter lambda is varied. For small values of lambda a single infection eventually dies out. For larger lambda the…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
Bezuidenhout and Grimmett proved that the critical contact process dies out. Here, we generalize the result to the so called contact process in a random evolving environment (CPREE), introduced by Erik Broman. This process is a…
The contact process is a stochastic process which exhibits a continuous, absorbing-state phase transition in the Directed Percolation (DP) universality class. In this work, we consider a contact process with a bias in conjunction with an…