相关论文: The cost of stochastic resetting

Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its…

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…

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…

Stochastic resetting, a method for accelerating target search in random processes, often incurs temporal and energetic costs. For a diffusing particle, a lower bound exists for the energetic cost of reaching the target, which is attained at…

We consider a stochastic process undergoing resetting after which a random refractory period is imposed. In this period the process is quiescent and remains at the resetting position. Using a first-renewal approach, we compute exactly the…

Stochastic resetting has been a subject of considerable interest within statistical physics, both as means of improving completion times of complex processes such as searches and as a paradigm for generating nonequilibrium stationary…

We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…

We consider a discrete-time continuous-space random walk, with a symmetric jump distribution, under stochastic resetting. Associated with the random walker are cost functions for jumps and resets, and we calculate the distribution of the…

Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal…

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…

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…

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 restart may drastically reduce the expected run time of a computer algorithm, expedite the completion of a complex search process, or increase the turnover rate of an enzymatic reaction. These diverse first-passage-time (FPT)…

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…

By periodically returning a search process to a known or random state, random resetting possesses the potential to unveil new trajectories, sidestep potential obstacles, and consequently enhance the efficiency of locating desired targets.…

First passage in a stochastic process may be influenced by the presence of an external confining potential, as well as "stochastic resetting" in which the process is repeatedly reset back to its initial position. Here we study the interplay…

Stochastic resetting, where a dynamical process is intermittently returned to a fixed reference state, has emerged as a powerful mechanism for optimizing first-passage properties. Existing theory largely treats static, non-learning…

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…

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…

In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then, the process recommences. Hitherto, the resetting mechanism…