Related papers: Drift-diffusive resetting search process with stoc…
We consider diffusion in arbitrary spatial dimension d with the addition of a resetting process wherein the diffusive particle stochastically resets to a fixed position at a constant rate $r$. We compute the non-equilibrium stationary state…
Diffusion with stochastic resetting, instantaneous returns of a diffusing particle to a reference point, creates a stationary probability distribution. The paradigm is extended here to a doubly stochastic protocol in which the resetting…
We consider the problem of the first passage time to the origin of a spatially non-homogeneous random walk with a position-dependent drift, known as the Gillis random walk, in the presence of resetting. The walk starts from an initial site…
Many chemical reactions can be formulated in terms of particle diffusion in a complex energy landscape. Transition path theory (TPT) is a theoretical framework for describing the direct (reaction) pathways from reactant to product states…
Recent works have explored the properties of L\'evy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the Mean First Passage Time (MFPT)…
Motion under stochastic resetting serves to model a myriad of processes in physics and beyond, but in most cases studied to date resetting to the origin was assumed to take zero time or a time decoupled from the spatial position at the…
First-passage processes can be divided in two classes: those that are accelerated by the introduction of restart and those that display an opposite response. In physical systems, a transition between the two classes may occur as governing…
We address some inverse problems for the first-passage place and the first-passage time of a one-dimensional diffusion process $\mathcal X(t)$ with stochastic resetting, starting from an initial position $\mathcal X(0)= \eta ;$ this type of…
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of $N$ independent finite-speed random searchers driven by dichotomous noise and described by the telegrapher's equation.…
Gated first-passage processes, where completion depends on both hitting a target and satisfying additional constraints, are prevalent across various fields. Despite their significance, analytical solutions to basic problems remain unknown,…
Stochastic resetting has recently emerged as an efficient target-searching strategy in various physical and biological systems. The efficiency of this strategy depends on the type of environmental noise, whether it is thermal or telegraphic…
Resetting a stochastic process is an important problem describing the evolution of physical, biological and other systems which are continually returned to their certain fixed point. We consider the motion of a subdiffusive particle with a…
We provide an exact formula for the mean first-passage time (MFPT) to a target at the origin for a single particle diffusing on a $d$-dimensional hypercubic {\em lattice} starting from a fixed initial position $\vec R_0$ and resetting to…
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 investigate a diffusion process in heterogeneous media where particles stochastically reset to their initial positions at a constant rate. The heterogeneous media is modeled using a spatial-dependent diffusion coefficient with a…
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$.…
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…
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$…
Evaluating the completion time of a random algorithm or a running stochastic process is a valuable tip not only from a purely theoretical, but also pragmatic point of view. In the formal sense, this kind of a task is specified in terms of…
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…