Related papers: First Passage Percolation with Recovery
We consider geodesics for first passage percolation (FPP) on $\mathbb{Z}^d$ with iid passage times. As has been common in the literature, we assume that the FPP system satisfies certain basic properties conjectured to be true, and derive…
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 introduce and study a non-oriented first passage percolation model having a property of statistical invariance by time reversal. This model is defined in a graph having directed edges and the passage times associated with each set of…
We show that a certain model for the spread of an infection has a phase transition in the recuperation rate. The model is as follows: There are particles or individuals of type A and type B, interpreted as healthy and infected,…
Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…
In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
Generative modeling is typically framed as learning mapping rules, but from an observer's perspective without access to these rules, the task becomes disentangling the geometric support from the probability distribution. We propose that…
We consider first passage percolation on certain isotropic random graphs in $\mathbb{R}^d$. We assume exponential concentration of passage times $T(x,y)$, on some scale $\sigma_r$ whenever $|y-x|$ is of order $r$, with $\sigma_r$ "growning…
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least…
Often sharp changes in cellular behavior are triggered by thresholded events, i.e., by the attainment of a threshold value of a relevant cellular or molecular dynamical variable. Since the governing variable itself typically undergoes noisy…
We address some inverse problems for the first-passage place and the first-passage time of a one-dimensional diffusion process $\mathcal X(t)$ with stochastic resetting, starting from an initial position $\mathcal X(0)= \eta ;$ this type of…
The standard setup for single-file diffusion is diffusing particles in one dimension which cannot overtake each other, where the dynamics of a tracer (tagged) particle is of main interest. In this article we generalise this system and…
In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We…
In first-passage percolation (FPP), we let $(\tau_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $\tau_v$, there are…
Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…
We study the spread of an infection on top of a moving population. The environment evolves as a zero range process on the integer lattice starting in equilibrium. At time zero, the set of infected particles is composed by those which are on…
We study a version of compact directed percolation (CDP) in one dimension in which occupation of a site for the first time requires that a "mine" or antiparticle be eliminated. This process is analogous to the variant of directed…
We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…
Applications of first passage times in stochastic processes arise across a wide range of length and time scales in biological settings. After an initial technical overview, we survey representative applications and their corresponding…