Related papers: Online minimum search for a Brownian bridge
Functionals of Brownian bridge arise as limiting distributions in nonparametric statistics. In this paper we will give a derivation of distributions of extrema of the Brownian bridge based on excursion theory for Brownian motion. Only the…
The classical Melan equation modeling suspension bridges is considered. We first study the explicit expression and the uniform positivity of the analytical solution for the simplified ``less stiff'' model, based on which we develop a…
We study the problem of stopping an $\alpha$-Brownian bridge as close as possible to its global maximum. This extends earlier results found for the Brownian bridge (the case $\alpha=1$). The exact behavior for $\alpha$ close to $0$ is…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
The $\alpha$-Brownian bridge, or scaled Brownian bridge, is a generalization of the Brownian bridge with a scaling parameter that determines how strong the force that pulls the process back to 0 is. The bias of the maximum likelihood…
We study the statistical inference problem for a complex $\alpha$-fractional Brownian bridge process $Z$ defined by the stochastic differential equation \[ \mathrm{d}Z_t = -\alpha \frac{Z_t}{T - t} \mathrm{d}t + \mathrm{d}\zeta_t, \quad t…
We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioning for inference. Our algorithm for finding a loop cutset, called MGA, finds a loop cutset which is…
The marginal likelihood plays an important role in many areas of Bayesian statistics such as parameter estimation, model comparison, and model averaging. In most applications, however, the marginal likelihood is not analytically tractable…
Given $a,b\ge 0$ and $t>0$, let $\rho =\{ \rho _{s}\} _{0\le s\le t}$ be a three-dimensional Bessel bridge from $a$ to $b$ over $[0,t]$. In this paper, based on a conditional identity in law between Brownian bridges stemming from Pitman's…
Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative?…
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.…
In the planted bisection model a random graph $G(n,p_+,p_- )$ with $n$ vertices is created by partitioning the vertices randomly into two classes of equal size (up to $\pm1$). Any two vertices that belong to the same class are linked by an…
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…
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an…
We develop a numerical method for the martingale analogue of the Benamou--Brenier optimal transport problem, which seeks a martingale interpolating two prescribed marginals which is closest to the Brownian motion. Recent contributions have…
We show that simple explicit formulas can be obtained for several relevant quantities related to the laws of the uniformly sampled Brownian bridge, Brownian meander and three dimensional Bessel process. To prove such results, we use the…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
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…
A knot is called minimal if its knot group admits epimorphisms onto the knot groups of only the trivial knot and itself. In this paper, we determine which two-bridge knot $\mathfrak{b}(p,q)$ is minimal where $q \leq 6$ or $p \leq 100$.
Aldous and Pitman (1994) studied asymptotic distributions, as n tends to infinity, of various functionals of a uniform random mapping of a set of n elements, by constructing a mapping-walk and showing these mapping-walks converge weakly to…