Related papers: First order transition for the optimal search time…
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at $b\geq0$ and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a…
Recent works have explored the properties of L\'evy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the Mean First Passage Time (MFPT)…
We consider diffusive motion of a particle performing a random walk with L\'evy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite…
In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…
L\'evy Flights are paradigmatic generalised random walk processes, in which the independent stationary increments---the "jump lengths"---are drawn from an $\alpha$-stable jump length distribution with long-tailed, power-law asymptote. As a…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
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…
First hitting times (FHTs) describe the time it takes a random "searcher" to find a "target" and are used to study timescales in many applications. FHTs have been well-studied for diffusive search, especially for small targets, which is…
For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…
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…
In this paper, we analyze the mean first passage time (MFPT) for a single Brownian particle to find a stochastically-gated target under the additional condition that the position of the particle is reset to a fixed position $\x_r$ at a rate…
The search for hidden targets is a fundamental problem in many areas of science, engineering, and other fields. Studies of search processes often adopt a probabilistic framework, in which a searcher randomly explores a spatial domain for a…
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 study the efficiency of random search processes based on L{\'e}vy flights with power-law distributed jump lengths in the presence of an external drift, for instance, an underwater current, an airflow, or simply the bias of the searcher…
We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the…
We study experimentally, numerically and theoretically the optimal mean time needed by a Brownian particle, freely diffusing either in one or two dimensions, to reach, within a tolerance radius $R_{\text tol}$, a target at a distance $L$…
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…
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 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…
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of $N$ independent finite-speed random searchers driven by dichotomous noise and described by the telegrapher's equation.…