Related papers: Optimal potentials for diffusive search strategies
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
We consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}^d,\ d\ge1$, with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion coefficient $D$.…
Resetting or restart, when applied to a stochastic process, usually brings its dynamics to a time-independent stationary state. In turn, the optimal resetting rate makes the mean time to reach a target to be the shortest one. These and…
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…
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)…
A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the…
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,…
We investigate random searches under stochastic position resetting at rate $r$, in a bounded 1D environment with space-dependent diffusivity $D(x)$. For arbitrary shapes of $D(x)$ and prescriptions of the associated multiplicative…
In this paper we use asymptotic analysis to determine the steady-state mean number of resources in each of $N$ small interior targets within a three-dimensional bounded domain. The accumulation of resources is based on multiple rounds of…
We investigate the search of a target with a given spatial distribution in a finite one-dimensional domain. The searcher follows Brownian dynamics and is always reset to its initial position when reaching the boundaries of the domain…
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…
Stochastic resetting has emerged as a useful strategy to reduce the completion time for a broad class of first passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start…
We consider the mean time to absorption by an absorbing target of a diffusive particle with the addition of a process whereby the particle is reset to its initial position with rate $r$. We consider several generalisations of the model of…
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a…
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,…
Stochastic resetting has attracted significant attention in recent years due to its wide-ranging applications across physics, biology, and search processes. In most existing studies, however, resetting events are governed by an external…
Despite having been studied for decades, first passage processes remain an active area of research. In this contribution we examine a particle diffusing in an annulus with an inner absorbing boundary and an outer reflective boundary. We…
We consider a problem of finding a target located in a finite $d$-dimensional domain, using $N$ independent random walkers, when partial information on the target location is given as a probability distribution. When $N$ is large, the…
We combine the processes of resetting and first-passage to define \emph{first-passage resetting}, where the resetting of a random walk to a fixed position is triggered by a first-passage event of the walk itself. In an infinite domain,…
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…