Related papers: First-passage times for random walks in bounded do…
First-passage phenomena play a fundamental role in classical stochastic processes. We here exactly solve a quantum first-passage time problem for quantum diffusion driven by measurement noise, a generalization of classical Brownian motion.…
We consider a Brownian particle diffusing in a one dimensional interval with absorbing end points. We study the ramifications when such motion is interrupted and restarted from the same initial configuration. We provide a comprehensive…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
The distribution of the first-passage time (FPT)$T_a$ for a Brownian particle with drift $\mu$ subject to hitting an absorber at a level $a>0$ is well-known and given by its density $\gamma(t) = \frac{a}{\sqrt{2 \pi t^3} } e^{-\frac{(a-\mu…
Random walks, and in particular, their first passage times, are ubiquitous in nature. Using direct enumeration of paths, we find the first return time distribution of a 1D random walker, which is a heavy-tailed distribution with infinite…
The purpose of this article is to compute the expected first exit times of Brownian motion from a variety of domains in the Euclidean plane and in the hyperbolic plane.
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
This paper considers the class of L\'evy processes that can be written as a Brownian motion time changed by an independent L\'evy subordinator. Examples in this class include the variance gamma model, the normal inverse Gaussian model, and…
New theorems for the moments of the first passage time of one dimensional nonlinear stochastic processes with an entrance boundary are formulated. This important class of one dimensional stochastic processes results among others from…
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…
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…
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach…
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…
We solve the problem of first-passage time for run-and-tumble particles in one dimension. Exact expression is derived for the mean first-passage time in the general case, considering external force-fields and chemotactic-fields, giving rise…
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…
In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was…
We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…
For drifted Brownian motion $X(t)= x - \mu t + B_t \ (\mu >0)$ starting from $x>0,$ we study the joint distribution of the first-passage time below zero, $\tau(x),$ and the first-passage area, $A(x),$ swept out by $X$ till the time…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…