Related papers: First Passage Percolation with Recovery
For first passage percolation on $\mathbb{Z}^2$ with i.i.d. bounded edge weights, we consider the upper tail large deviation event; i.e., the rare situation where the first passage time between two points at distance $n$, is macroscopically…
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…
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of $N$ nodes of degree $c \ge 3$. Starting from a random initial node $i$ at time $t=0$, at each…
In this paper we focus on $r$-neighbor bootstrap percolation, which is a process on a graph where initially a set $A_0$ of vertices gets infected. Now subsequently, an uninfected vertex becomes infected if it is adjacent to at least $r$…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
In this paper we study the joint distributions of the telegraph process and its maximum conditioned on the number of changes of direction and the initial velocity. We prove that in the case of positive starting velocity, a form of the…
The $r$-bond bootstrap percolation process on a graph $G$ begins with a set $S$ of infected edges of $G$ (all other edges are healthy). At each step, a healthy edge becomes infected if at least one of its endpoints is incident with at least…
The approach the first-passage time (FPT) of a random process to a certain level is applied to the description of radiation-enhanced diffusion. This is an integral approach to describing the problem of radiation-enhanced diffusion, which…
We study a competitive stochastic growth model called chase-escape in which red particles spread to adjacent uncolored sites and blue only to adjacent red sites. Red particles are killed when blue occupies the same site. If blue has rate-1…
This paper is dedicated to the memory of Dietrich Stauffer, who was a pioneer in percolation theory and applications of it to problems of society, such as epidemiology. An epidemic is a percolation process gone out of control, that is,…
We study the first-passage time (FPT) problem for widespread recurrent processes in confined though large systems and present a comprehensive framework for characterizing the FPT distribution over many time scales. We find that the FPT…
This paper describes a mathematical model for the spread of a virus through an isolated population of a given size. The model uses three, color-coded components, called molecules (red for infected and still contagious; green for infected,…
We study the diffusion process in the presence of stochastic resetting inside a two-dimensional wedge of top angle $\alpha$, bounded by two infinite absorbing edges. In the absence of resetting, the second moment of the first-passage time…
We investigate the diffusive motion of an overdamped classical particle in a 1D random potential using the mean first-passage time formalism and demonstrate the efficiency of this method in the investigation of the large-time dynamics of…
We investigate a novel first-passage percolation model, referred to as the Brochette first-passage percolation model, where the passage times associated with edges lying on the same line are equal. First, we establish a point-to-point…
We solve the first-passage problem for the Heston random diffusion model. We obtain exact analytical expressions for the survival and hitting probabilities to a given level of return. We study several asymptotic behaviors and obtain…
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…