Related papers: Capture of a diffusive prey by multiple predators …
First passage time (FPT) theory is often used to estimate timescales in cellular and molecular biology. While the overwhelming majority of studies have focused on the time it takes a given single Brownian searcher to reach a target,…
A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a non-monotonic behavior as a function of the…
Many scientific questions can be framed as asking for a first passage time (FPT), which generically describes the time it takes a random "searcher" to find a "target." The important timescale in a variety of biophysical systems is the time…
We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search…
Random search for one or more targets in a bounded domain occurs widely in nature, with examples ranging from animal foraging to the transport of vesicles within cells. Most theoretical studies take a searcher-centric viewpoint, focusing on…
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
We investigate a minimal chase-and-escape model on a two-dimensional square lattice with randomly distributed static obstacles, focusing on how geometric disorder controls collective pursuit dynamics. Chasers and escapers move according to…
We study the capture of a diffusing "lamb" by diffusing "lions" in one dimension. The capture dynamics is exactly soluble by probabilistic techniques when the number of lions is very small, and is tractable by extreme statistics…
We present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…
We use a lattice model to study first-passage time distributions of target finding events through complex environments with elongated fibers distributed with different anisotropies and volume occupation fractions. For isotropic systems and…
We determine the survival probability and first-passage time (FPT) to capture for a harmonically trapped particle, diffusing outside an absorbing spherical boundary by directly solving the differential equation for the survival probability.…
The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…
We study the degree of success of a single predator hunting a herd of prey on a two dimensional square lattice landscape. We explicitly consider the self volume of the prey restraining their dynamics on the lattice. The movement of both…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
Cover times measure the speed of exhaustive searches which require the exploration of an entire spatial region(s). Applications include the immune system hunting pathogens, animals collecting food, robotic demining or cleaning, and computer…
How long a stochastic process survives before leaving a domain depends not only on its intrinsic dynamics but also on how it is observed. Classical first-passage theory assumes continuous monitoring with absorbing boundaries…
We analyze velocity-jump process models of persistent search for a single target on a bounded domain. The searcher proceeds along ballistic trajectories and is absorbed upon collision with the target boundary. When reaching the domain…
A random search is a stochastic process representing the random motion of a particle (denoted as the searcher) that is terminated when it reaches (detects) a target particle or area the first time. In intermittent search the random motion…
We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…