Related papers: Optimal Resetting Brownian Bridges
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…
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…
The theory of stochastic resetting asserts that restarting a stochastic process can expedite its completion. In this paper, we study the escape process of a Brownian particle in an open Hamiltonian system that suffers noise-enhanced…
We study the statistical properties of first-passage time functionals of a one dimensional Brownian motion in the presence of stochastic resetting. A first-passage functional is defined as $V=\int_0^{t_f} Z[x(\tau)]$ where $t_f$ is the…
The problem of stopping a Brownian bridge with an unknown pinning point to maximise the expected value at the stopping time is studied. A few general properties, such as continuity and various bounds of the value function, are established.…
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover…
We propose a generalization of the stochastic resetting mechanism for a Brownian particle diffusing in a one-dimensional periodic potential: randomly in time, the particle gets reset at the bottom of the potential well it was in. Numerical…
We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…
Consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is…
In this paper, we study reflecting Brownian motion with Poissonian resetting. After providing a probabilistic description of the phenomenon using jump diffusions and semigroups, we analyze the time-reversed process starting from the…
We propose a novel stochastic method to exactly generate Brownian paths conditioned to start at an initial point and end at a given final point during a fixed time $t_{f}$. These paths are weighted with a probability given by the overdamped…
We study the distribution of additive functionals of reset Brownian motion, a variation of normal Brownian motion in which the path is interrupted at a given rate and placed back to a given reset position. Our goal is two-fold: (1) For…
This paper is concerned with various aspects of the Slepian process $(B_{t+1} - B_t, t \ge 0)$ derived from a one-dimensional Brownian motion $(B_t, t \ge 0 )$. In particular, we offer an analysis of the local structure of the Slepian zero…
In many physical situations, there appears the problem of reaching a single target that is spatially distributed. Here we analyse how stochastic resetting, also spatially distributed, can be used to improve the search process when 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 derive P(M,t_m), the joint probability density of the maximum M and the time t_m at which this maximum is achieved for a class of constrained Brownian motions. In particular, we provide explicit results for excursions, meanders and…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We study the problem of a target search by a Brownian particle subject to stochastic resetting to a pair of sites. The mean search time is minimized by an optimal resetting rate which does not vary smoothly, in contrast with the well-known…
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…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…