Related papers: First passage times with fast immigration
We study the effect of a resetting point randomly distributed around the origin on the mean first passage time of a Brownian searcher moving in one dimension. We compare the search efficiency with that corresponding to reset to the origin…
We derive an approximate formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape inside an elongated domain of a slowly varying axisymmetric profile. For this purpose, the original Poisson equation in…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
We consider a Markovian jumping process with two absorbing barriers, for which the waiting-time distribution involves a position-dependent coefficient. We solve the Fokker-Planck equation with boundary conditions and calculate the mean…
We present a simple paradigm for detection of an immobile target by a space-time coupled random walker with a finite lifetime. The motion of the walker is characterized by linear displacements at a fixed speed and exponentially distributed…
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 of the first occurrence of a threshold crossing event in a stochastic process, known as the first passage time, is of interest in many areas of sciences and engineering. Conventionally, there is an implicit assumption that the…
The mean first passage time, one of the important characteristics for a stochastic process, is often calculated assuming the observation time is infinite. However, in practice, the observation time, T, is always finite and the mean first…
In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…
We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…
The first-passage time is proposed as an independent thermodynamic parameter of the statistical distribution that generalizes the Gibbs distribution. The theory does not include the determination of the first passage statistics itself. A…
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…
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…
We derive a general exact formula for the mean first passage time (MFPT) from a fixed point inside a planar domain to an escape region on its boundary. The underlying mixed Dirichlet-Neumann boundary value problem is conformally mapped onto…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
The mean first-passage time (MFPT) is one standard measure for the reaction time in thermally activated barrier-crossing processes. While the relationship between MFPTs and phenomenological rate coefficients is known for systems that…
All real physical processes, including of the first-passage time, occur with a change in entropy. This circumstance is not taken into account when studying the first-passage time, but is illustrated in this article using the example of…
Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its…
We study the first hitting time statistics between a one-dimensional run-and-tumble particle and a target site that switches intermittently between visible and invisible phases. The two-state dynamics of the target is independent of the…
We propose an analytical approach to study non-Markov random walks by employing an exact enumeration method. Using the method, we derive an exact expansion for the first-passage time (FPT) distribution for any continuous, differentiable…