Related papers: Cover times with stochastic resetting
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…
We consider diffusion under stochastic resetting to the origin in one dimension and compute the mean time to find both of two targets placed either side of the origin. A surprising result is that increasing the distance between two targets…
We consider $N$ Brownian motions diffusing independently on a line, starting at $x_0>0$, in the presence of an absorbing target at the origin. The walkers undergo stochastic resetting under two protocols: (A) each walker resets…
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the…
We consider motion of an overdamped Brownian particle subject to stochastic resetting in one dimension. In contrast to the usual setting where the particle is instantaneously reset to a preferred location (say, the origin), here we consider…
We study the dynamics of overdamped Brownian particles diffusing in conservative force fields and undergoing stochastic resetting to a given location with a generic space-dependent rate of resetting. We present a systematic approach…
A space fractional diffusion-like equation is introduced, which embodies the nonlocality in time, represented by the memory kernel and the non-locality in space. A specific example of the nonlocal term is considered in combination with…
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at $b\geq0$ and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a…
We consider the occupation area of spherical (fractional) Brownian motion, i.e. the area where the process is positive, and show that it is uniformly distributed. For the proof, we introduce a new simple combinatorial view on occupation…
Stochastic processes under resetting at random times have attracted a lot of attention in recent years and served as illustrations of nontrivial and interesting static and dynamic features of stochastic dynamics. In this paper, we aim to…
We consider a single Brownian particle in one dimension in a medium at a constant temperature in the underdamped regime. We stochastically reset the position of the Brownian particle to a fixed point in the space with a constant rate $r$…
Stochastic resetting can be naturally understood as a renewal process governing the evolution of an underlying stochastic process. In this work, we formally derive well-known results of diffusion with resets from a renewal theory…
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,…
In this paper we consider diffusion in a domain $\Omega$ containing a partially absorbing target $\calM$ with position and occupation time resetting. The occupation time $A_t$ is a Brownian functional that determines the amount of time that…
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…
We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some…
Identifying optimal strategies for efficient spatial exploration is crucial, both for animals seeking food and for robotic search processes, where maximizing the covered area is a fundamental requirement. Here, we propose position resetting…
Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these…
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach…
The strategy of stochastic resetting is known to expedite the first passage to a target, in diffusive systems. Consequently, the mean first passage time is minimized at an optimal resetting parameter. With Poisson resetting, vanishing…