Related papers: Optimal Resetting Brownian Bridges
We study the effect of a resetting point randomly distributed around the origin on the mean first passage time of a Brownian searcher moving in one dimension. We compare the search efficiency with that corresponding to reset to the origin…
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…
For $d\ge1$ and $r>0$, let $X^{(d;r)}(\cdot)$ be a $d$-dimensional Brownian motion with diffusion coefficient $D$, equipped with an exponential clock with rate $r$. When the clock rings, the process jumps to the origin and begins anew. For…
We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the…
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$…
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,…
We address the problem of minimizing the expected first-passage time of a Brownian motion with Poissonian resetting, with respect to the resetting rate $r.$ We consider both the one-boundary and the two-boundary cases.We investigate the…
Fractional Brownian motion is a self-affine, non-Markovian and translationally invariant generalization of Brownian motion, depending on the Hurst exponent $H$. Here we investigate fractional Brownian motion where both the starting and the…
Stochastic resetting has attracted significant attention in recent years due to its wide-ranging applications across physics, biology, and search processes. In most existing studies, however, resetting events are governed by an external…
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…
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…
Designing navigation strategies for search time optimization remains of interest in various interdisciplinary branches in science. In here, we focus on microscopic self-propelled searchers namely active Brownian walkers in noisy and…
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…
Brownian motion with stochastic resetting-a process combining standard diffusion with random returns to a fixed position-has emerged as a powerful framework with applications spanning statistical physics, chemical kinetics, biology, and…
We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. In here, search agents are…
We study a Brownian particle diffusing under a time-modulated stochastic resetting mechanism to a fixed position. The rate of resetting r(t) is a function of the time t since the last reset event. We derive a sufficient condition on r(t)…
In this paper, we introduce an extension of a Brownian bridge with a random length by including uncertainty also in the pinning level of the bridge. The main result of this work is that unlike for deterministic pinning point, the bridge…
We study the random acceleration model, which is perhaps one of the simplest, yet nontrivial, non-Markov stochastic processes, and is key to many applications. For this non-Markov process, we present exact analytical results for the…
We investigate the search of a target with a given spatial distribution in a finite one-dimensional domain. The searcher follows Brownian dynamics and is always reset to its initial position when reaching the boundaries of the domain…
We consider the problem of optimally stopping a Brownian bridge with an unknown pinning time so as to maximise the value of the process upon stopping. Adopting a Bayesian approach, we assume the stopper has a general continuous prior and is…