Related papers: On the threshold of spread-out contact process per…
We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\delta$. We identify the critical percolation threshold as…
An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…
We study a generalization of the classical contact process (SIS epidemic model) in a directed graph $G$. Our model is a continuous-time interacting particle system in which at every time, each vertex is either healthy or infected, and each…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method…
Deterministic classical cellular automata can be in two phases, depending on how irreversible the dynamical rules are. In the strongly irreversible phase, trajectories with different initial conditions coalesce quickly, while in the weakly…
The pair contact process (PCP) is a nonequilibrium stochastic model which, like the basic contact process (CP), exhibits a phase transition to an absorbing state. The two models belong to the directed percolation (DP) universality class,…
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these…
We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…
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…
A $(1+1)$ dimensional model of directed percolation is introduced where sites on a tilted square lattice are connected to their neighbours by $N$ channels, operated at both ends by valves which are either open or closed. The spreading fluid…
Bootstrap percolation on a graph with infection threshold $r\in \mathbb{N}$ is an infection process, which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes…
We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…
We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett, who showed that for arbitrarily small infection parameter $\lambda$, the survival time of…
We study the absorbing phase transition for the model of epidemic spreading, Susceptible- Infected- Refractory (SIR), on one dimensional small world networks. This model has been found to be in the universality class of the dynamical…
The non-equilibrium phase transition in models for epidemic spreading with long-range infections in combination with incubation times is investigated by field-theoretical and numerical methods. Here the spreading process is modelled by…
We consider oriented percolation on Z^d times Z_+ whose bond-occupation probability is pD(...), where p is the percolation parameter and D is a probability distribution on Z^d. Suppose that D(x) decays as |x|^{-d-\alpha} for some \alpha>0.…
Human to human transmissible infectious diseases spread in a population using human interactions as its transmission vector. The early stages of such an outbreak can be modeled by a graph whose edges encode these interactions between…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
We study a one-dimensional contact process with two infection parameters, one giving the infection rates at the boundaries of a finite infected region and the other one the rates within that region. We prove that the critical value of each…
We determine the site and bond percolation thresholds for a system of disordered jammed sphere packings in the maximally random jammed state, generated by the Torquato-Jiao algorithm. For the site threshold, which gives the fraction of…