Related papers: Hitting probabilities for fast stochastic search
Resetting has been shown to reduce the completion time for a stochastic process, such as the first passage time for a diffusive searcher to find a target. The time between two consecutive resetting events is drawn from a waiting time…
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
We study simple diffusion where a particle stochastically resets to its initial position at a constant rate r. A finite resetting rate leads to a nonequilibrium stationary state with non-Gaussian fluctuations for the particle position. We…
Stochastic processes that are randomly reset to an initial condition serve as a showcase to investigate non-equilibrium steady states. However, all existing results have been restricted to the special case of memoryless resetting protocols.…
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…
Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in…
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…
The cost of stochastic resetting is considered within the context of a discrete random walk model. In addition to standard stochastic resetting, for which a reset occurs with a certain probability after \emph{each} step, we introduce a…
When people pursue rewards in stochastic environments, they often match their choice frequencies to the observed target frequencies, even when this policy is demonstrably sub-optimal. We used a ``hide and seek'' task to evaluate this…
In this paper, we conduct a literature review of laws of motion based on stochastic search strategies which are mainly focused on exploring highly dynamic environments. In this regard, stochastic search strategies represent an interesting…
Proper management of resources whose arrival and consumption are subject to environmental randomness is an intrinsic process in both natural and artificial systems. This phenomenon can be modeled as a queuing process whose arrival…
We study discrete-time random walks on networks subject to a time-dependent stochastic resetting, where the walker either hops randomly between neighboring nodes with a probability $1-\phi(a)$, or is reset to a given node with a…
We investigate a stochastic search process in one, two, and three dimensions in which $N$ diffusing searchers that all start at $x_0$ seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate…
Many recent studies use individual longitudinal data to analyze job search behaviors. Such data allow the use of fixed-effects models, which supposedly address the issue of dynamic selection and make it possible to identify the structural…
Local search methods can quickly find good quality solutions in cases where systematic search methods might take a large amount of time. Moreover, in the context of pattern set mining, exhaustive search methods are not applicable due to the…
Molecular search phenomena are observed in a variety of chemical and biological systems. During the search the participating particles frequently move in complex inhomogeneous environments with random transitions between different dynamic…
We extend the theoretical framework used to study search processes with stochastic resetting to the case of partially absorbing targets. Instead of an absorption event occurring when the search particle reaches the boundary of a target, the…
In population genetics, diffusions on the unit interval are often used to model the frequency path of an allele. In this setting we derive approximations for fixation probabilities, expected hitting times and the expected…
Will the strategy of resetting} help a stochastic process to reach its target efficiently, with its environment continually toggling between a strongly favourable and an unfavourable (or weakly favourable) state? A diffusive run-and-tumble…