Related papers: Cover times with stochastic resetting
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…
The speed of an exhaustive search can be measured by a cover time, which is defined as the time it takes a random searcher to visit every state in some target set. Cover times have been studied in both the physics and probability…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…
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…
The mean completion time of a stochastic process may be rendered finite and minimised by a judiciously chosen restart protocol, which may either be stochastic or deterministic. Here we study analytically an arbitrary stochastic search…
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…
The effects of Poissonian resetting at a constant rate $r$ on the reaction time between a Brownian particle and a stochastically gated target are studied. The target switches between a reactive state and a non-reactive one. We calculate the…
Consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is…
We investigate an intermittent stochastic process in which the diffusive motion with time-dependent diffusion coefficient $D(t) \sim t^{\alpha -1}$ with $\alpha > 0$ (scaled Brownian motion) is stochastically reset to its initial position,…
Diffusion with stochastic resetting has recently emerged as a powerful modeling tool with a myriad of potential applications. Here, we study local time in this model, covering situations of free and biased diffusion with, and without, the…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
We investigate an intermittent stochastic process, in which the diffusive motion with time-dependent diffusion coefficient $D(t)\sim t^{\alpha-1}$, $\alpha>0$ (scaled Brownian motion), is stochastically reset to its initial position and…
A new model of search based on stochastic resetting is introduced, wherein rate of resets depends explicitly on time elapsed since the beginning of the process. It is shown that rate inversely proportional to time leads to paradoxical…
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…
Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting probability, is often of considerable interest. In this work…
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$.…
Stochastic resetting is a rapidly developing topic in the field of stochastic processes and their applications. It denotes the occasional reset of a diffusing particle to its starting point and effects, inter alia, optimal first-passage…
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…
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 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$…