Related papers: Bridge Simulation and Metric Estimation on Lie Gro…
A reinforcement algorithm introduced by H.A. Simon \cite{Simon} produces a sequence of uniform random variables with memory as follows. At each step, with a fixed probability $p\in(0,1)$, $\hat U_{n+1}$ is sampled uniformly from $\hat U_1,…
A framework for performant Brownian Dynamics (BD) many-body simulations with adaptive timestepping is presented. Contrary to the Euler-Maruyama scheme in common non-adaptive BD, we employ an embedded Heun-Euler integrator for the…
We prove a property of Brownian bridges whose certain time-equidistant sequences of points are pairwise coupled by an interaction. Roughly saying, if the total time span $t$ of the bridge tends to infinity while the distance of its end…
We observe that the probability distribution of the Brownian motion with drift $-c \frac x {1-t}$ where $c\not =1$ is singular with respect to that of the classical Brownian bridge measure on $[0,1]$, while their Cameron-Martin spaces are…
We demonstrate effectiveness of the first-order algorithm from [Milstein, Tretyakov. Theory Prob. Appl. 47 (2002), 53-68] in application to barrier option pricing. The algorithm uses the weak Euler approximation far from barriers and a…
Simulation schemes for probabilistic inference in Bayesian belief networks offer many advantages over exact algorithms; for example, these schemes have a linear and thus predictable runtime while exact algorithms have exponential runtime.…
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…
This study aims to construct a stochastic process called "Brownian house-moving," which is a Brownian bridge conditioned to stay between two curves. To construct this process, statements are prepared on the weak convergence of conditioned…
We consider one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(\eta)$, including the case of L\'evy flights. We study the expected maximum ${\mathbb E}[M_n]$ of bridge RWs, i.e.,…
The main purpose of this paper is to investigate the strong approximation of the $p$-fold integrated empirical process, $p$ being a fixed positive integer. More precisely, we obtain the exact rate of the approximations by a sequence of…
Bridge sampling is a powerful Monte Carlo method for estimating ratios of normalizing constants. Various methods have been introduced to improve its efficiency. These methods aim to increase the overlap between the densities by applying…
We study approximations for the L\'evy area of Brownian motion which are based on the Fourier series expansion and a polynomial expansion of the associated Brownian bridge. Comparing the asymptotic convergence rates of the L\'evy area…
Metric graphs are structures obtained by associating edges in a standard graph with segments of the real line and gluing these segments at the vertices of the graph. The resulting structure has a natural metric that allows for the study of…
The current understanding of pinned Brownian bridges is based on the Onsager-Machlup (OM) functional. The continuous-time limit of the OM functional can be expressed either by using the Fokker-Planck equation or by using the Radon-Nikodym…
The standard functional central limit theorem for a renewal process with finite mean and variance, results in a Brownian motion limit. This note shows how to obtain a Brownian bridge process by a direct procedure that does not involve…
We introduce a simulation scheme for Brownian semistationary processes, which is based on discretizing the stochastic integral representation of the process in the time domain. We assume that the kernel function of the process is regularly…
The paper deals with the asymptotic behavior of the bridge of a Gaussian process conditioned to stay in $n$ fixed points at $n$ fixed past instants. In particular, functional large deviation results are stated for small time. Several…
We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time $t_f$ is finite and the searcher returns to its starting point at $t_f$. This is simply a Brownian motion with a Poissonian…
We derive explicit formulas for probabilities of Brownian motion with jumps crossing linear or piecewise linear boundaries in any finite interval. We then use these formulas to approximate the boundary crossing probabilities for general…
An exact expression of the bridge-mediated donor-acceptor effective coupling, is derived. For systems represented by a tight-binding Hamiltonian with nearest-neighbor interactions, we show that the effective coupling, is equal to the…