Related papers: First Passage Percolation with nonidentical passag…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

The first passage statistics of a continuous time random walker with Poisson distributed jumps on one and two dimensional infinite lattices is investigated. An exact expression for the probability of first return to the origin in one…

Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…

Given a discrete-time non-lattice supercritical branching random walk in $\mathbb{R}^d$, we investigate its first passage time to a shifted unit ball of a distance $x$ from the origin, conditioned upon survival. We provide precise…

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 study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…

We correct a previously erroneous calculation [Phys. Rev. E 62, 6065 (2000)] of the mean first passage time of a subdiffusive process to reach either end of a finite interval in one dimension. The mean first passage time is in fact…

We consider the model of i.i.d. first passage percolation on Z^d, where we associate with the edges of the graph a family of i.i.d. random variables with common distribution G on [0, +$\infty$] (including +$\infty$). Whereas the time…

Let $d$ be any positive and non square integer. We prove an upper bound for the first two moments of the length $T(d)$ of the period of the continued fraction expansion for $\sqrt{d}$. This allows to improve the existing results for the…

First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to…

The time to first crossing for the Poisson counting process with respect to a linear moving barrier with offset is a classic problem, although key results remain scattered across the literature and their equivalence is often unclear. Here…

Let $W$ be a standard Brownian motion with $W_0 = 0$ and let $b: \mathbb{R}_+ \to \mathbb{R}$ be a continuous function with $b(0) > 0$. The first passage time (from below) is then defined as \begin{align*} \tau := \inf \{ t \geq 0 \vert W_t…

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

Using the martingale approach we find sufficient conditions for exponential boundedness of first passage times over a level for ergodic first order autoregressive sequences (AR(1)). Further, we prove a martingale identity to be used in…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

In this paper, we prove a phase transition in the connectivity of Finitary Random interlacements $\mathcal{FI}^{u,T}$ in $\mathbb{Z}^d$, with respect to the average stopping time. For each $u>0$, with probability one $\mathcal{FI}^{u,T}$…

Let $a,n \in \mathbb{Z}^+$, with $a<n$ and $\gcd(a,n)=1$. Let $P_{a,n}$ denote the lattice parallelogram spanned by $(1,0)$ and $(a,n)$, that is, $$P_{a,n} = \left\{ t_1(1,0)+ t_2(a,n) \, : \, 0\leq t_1,t_2 \leq 1 \right\}, $$ and let…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture…

We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…