Related papers: Optimal Resetting Brownian Bridges
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
We study ergodic properties of one-dimensional Brownian motion with resetting. Using generic classes of statistics of times between resets, we find respectively for thin/fat tailed distributions, the normalized/non-normalised invariant…
For a fixed flow-based generative model under a small inference budget, sample quality can depend strongly on where the sampler spends its few function evaluations. Flow matching and Schr\"odinger bridges define probability paths, yet their…
Many inverse problems require reconstructing physical fields from limited and noisy data while incorporating known governing equations. A growing body of work within probabilistic numerics formalizes such tasks via Bayesian inference in…
For three constrained Brownian motions, the excursion, the meander, and the reflected bridge, the densities of the maximum and of the time to reach it were expressed as double series by Majumdar, Randon-Furling, Kearney, and Yor (2008).…
We employ renewal processes to characterize the spatiotemporal dynamics of an active Brownian particle under stochastic orientational resetting. By computing the experimentally accessible intermediate scattering function (ISF) and…
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 an optimal stopping problem for the expected value of a discounted payoff on a regime-switching geometric Brownian motion under two constraints on the possible stopping times: only at exogenous random times and only during a…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
In the classical context, it is well known that, sometimes, if the search does not find its target, it is better to start the process anew again, known as resetting. The quantum counterpart of resetting also indicates speeding up the…
Autonomous active Brownian ratchets rectify active Brownian particle motion solely by means of a spatially modulated but stationary activity, without external forces. We argue that such ratcheting requires at least a two-dimensional…
We study first-passage time problems for a diffusive particle with stochastic resetting with a finite rate $r$. The optimal search time is compared quantitatively with that of an effective equilibrium Langevin process with the same…
Barrier crossing is a widespread phenomenon across natural and engineering systems. While an abundant cross-disciplinary literature on the topic has emerged over the years, the stochastic underpinnings of the process are yet to be linked…
We address a general optimal switching problem over finite horizon for a stochastic system described by a differential equation driven by Brownian motion. The main novelty is the fact that we allow for infinitely many modes (or regimes,…
A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…
Brownian motion is the only random process which is Gaussian, stationary and Markovian. Dropping the Markovian property, i.e. allowing for memory, one obtains a class of processes called fractional Brownian motion, indexed by the Hurst…
The conditional density of Brownian motion is considered given the max, B(t|\max), as well as those with additional information: B(t|close, max), B(t|close, max, min) and B(t|max, min) where the close is the final value: B(t=1)=c and t in…
One of the characteristic features of a stochastic process under resetting is that the probability density converges to a nonequilibrium stationary state (NESS). In addition, the approach to the stationary state exhibits a dynamical phase…
We propose a method to exactly generate Brownian paths $x_c(t)$ that are constrained to return to the origin at some future time $t_f$, with a given fixed area $A_f = \int_0^{t_f}dt\, x_c(t)$ under their trajectory. We derive an exact…
We study the optimal stopping of an $\alpha$-dimensional Bessel bridge for the payoff $\phi(x)=x^n$, where $\alpha,n>0$. As a special case we consider the Brownian excursion with the identity function as the payoff ($\alpha=3,n=1$). For the…