相关论文: Stochastic Search with Poisson and Deterministic R…

In this Topical Review we consider stochastic processes under resetting, which have attracted a lot of attention in recent years. We begin with the simple example of a diffusive particle whose position is reset randomly in time with a…

In this paper we consider a random search process with stochastic resetting and a partially accessible target $\calU$. That is, when the searcher finds the target by attaching to its surface $\partial \calU$ it does not have immediate…

We study first-passage time problems for a diffusive particle with stochastic resetting with a finite rate $r$. The optimal search time is compared quantitatively with that of an effective equilibrium Langevin process with the same…

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…

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…

Stochastic resetting, the procedure of stopping and re-initializing random processes, has recently emerged as a powerful tool for accelerating processes ranging from queuing systems to molecular simulations. However, its usefulness is…

Resetting a stochastic process has been shown to expedite the completion time of some complex tasks, such as finding a target for the first time. Here we consider the cost of resetting by associating to each reset a cost, which is a…

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…

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…

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…

In this paper, we study a simple model of a diffusive particle on a line, undergoing a stochastic resetting with rate $r$, via rescaling its current position by a factor $a$, which can be either positive or negative. For $|a|<1$, the…

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…

We introduce a search problem generalizing the typical setting of Binary Search on the line. Similar to the setting for Binary Search, a target is chosen adversarially on the line, and in response to a query, the algorithm learns whether…

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 analyze predator-prey dynamics in one dimension in which a Brownian predator adopts a chasing strategy that consists in stochastically resetting its current position to locations previously visited by a diffusive prey. We study three…

Resetting, in which a system is regularly returned to a given state after a fixed or random duration, has become a useful strategy to optimize the search performance of a system. While earlier theoretical frameworks focused on instantaneous…

We look into the problem of stochastic resetting with refractory periods. The model dynamics comprises diffusive and motionless phases. The diffusive phase ends at random time instants, at which the system is reset to a given position --…

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 consider the one-dimensional dynamical evolution of a particle traveling at constant speed and performing, at a given rate, random reversals of the velocity direction. The particle is subject to stochastic resetting,…

We study independent searchers competing for a target under restarts and find that introduction of restarts tends to enhance the search efficiency of an already efficient searcher. As a result, the difference between the search…