Related papers: Fastest first-passage time for multiple searchers …
We study the first-passage-time (FPT) properties of an active Brownian particle under stochastic resetting to its initial configuration, comprising its position and orientation, to reach an absorbing wall in two dimensions. Coupling a…
Anomalous subdiffusion characterizes transport in diverse physical systems and is especially prevalent inside biological cells. In cell biology, the prevailing model for chemical activation rates has recently changed from the first passage…
The narrow escape problem is a first-passage problem concerned with randomly moving particles in a physical domain, being trapped by absorbing surface traps (windows), such that the measure of traps is small compared to the domain size. The…
The time instant -- the first-passage time (FPT) -- when a diffusive particle (e.g., a ligand such as oxygen or a signalling protein) for the first time reaches an immobile target located on the surface of a bounded three-dimensional domain…
A common scenario in a variety of biological systems is that multiple particles are searching in parallel for an immobile target located in a bounded domain, and the fastest among them that arrives to the target first triggers a given…
The first time a searcher finds a target is called a first passage time (FPT). In many physical, chemical, and biological processes, the searcher is "mortal," which means that the searcher might become inactivated (degrade, die, etc.)…
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,…
Biological events are often initiated when a random "searcher" finds a "target," which is called a first passage time (FPT). In some biological systems involving multiple searchers, an important timescale is the time it takes the slowest…
We derive an approximate but fully explicit formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape in a general elongated domain in the plane. Our approximation combines conformal mapping, boundary…
The time it takes the fastest searcher out of $N\gg1$ searchers to find a target determines the timescale of many physical, chemical, and biological processes. This time is called an extreme first passage time (FPT) and is typically much…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
Motivated by the dynamics of resonant neurons we discuss the properties of the first passage time (FPT) densities for nonmarkovian differentiable random processes. We start from an exact expression for the FPT density in terms of an…
Intracellular transport in living cells is often spatially inhomogeneous with an accelerated effective diffusion close to the cell membrane and a ballistic motion away from the centrosome due to active transport along actin filaments and…
We develop novel numerical methods and perturbation approaches to determine the mean first passage time (MFPT) for a Brownian particle to be captured by either small stationary or mobile traps inside a bounded 2-D confining domain. Of…
We derive a functional equation for the mean first-passage time (MFPT) of a generic self-similar Markovian continuous process to a target in a one-dimensional domain and obtain its exact solution. We show that the obtained expression of the…
The mean first passage time (MFPT) is a key metric for understanding transport, search, and escape processes in stochastic systems. While well characterized for passive Brownian particles, its behavior in active systems-such as active…
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…
Many events in biology are triggered when a diffusing searcher finds a target, which is called a first passage time (FPT). The overwhelming majority of FPT studies have analyzed the time it takes a single searcher to find a target. However,…
During a random search, resetting the searcher's position from time to time to the starting point often reduces the mean completion time of the process. Although many different resetting models have been studied over the past ten years,…
We consider one dimensional diffusive search strategies subjected to external potentials. The location of a single target is drawn from a given probability density function (PDF) $f_G(x)$ and is fixed for each stochastic realization of the…