Related papers: Online minimum search for a Brownian bridge
For a continuous function $f \in \mathcal{C}([0,1])$, define the Vervaat transform $V(f)(t):=f(\tau(f)+t \mod1)+f(1)1_{\{t+\tau(f) \geq 1\}}-f(\tau(f))$, where $\tau(f)$ corresponds to the first time at which the minimum of $f$ is attained.…
We introduce a new polynomial invariant of virtual knots and links and use this invariant to compute a lower bound on the virtual crossing number and the minimal surface genus.
We investigate the typical sizes and shapes of sets of points obtained by irregularly tracking two-dimensional Brownian bridges. The tracking process consists of observing the path location at the arrival times of a non-homogeneous Poisson…
We reprove a necessary condition for the Sakuma-Weeks triangulation of a 2-bridge link complement to be minimal in terms of the mapping class describing its alternating 4-string braid construction. For the 2-bridge links satisfying this…
In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we…
The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…
In the Minimum Bisection problem, input is a graph $G$ and the goal is to partition the vertex set into two parts $A$ and $B$, such that $||A|-|B|| \le 1$ and the number $k$ of edges between $A$ and $B$ is minimized. This problem can be…
A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…
In the first part of this paper we give easy and intuitive proofs for the small value probabilities of the martingale limit of a supercritical Galton-Watson process in both the Schr\"oder and the B\"ottcher case. These results are…
Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an $s$-$t$ articulation point of $G$ is a node whose removal breaks all $s$-$t$ paths…
We formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and…
For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in $O(n\log n)$ time where…
We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can…
In this paper we survey with complete proofs some well--known, but hard to find, results about constructing closed embedded minimal surfaces in a closed 3-dimensional manifold via min--max arguments. This includes results of J. Pitts, F.…
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias…
We consider the problem of efficient estimation for the drift of fractional Brownian motion $B^H:=(B^H_t)_{t\in[0,T]}$ with hurst parameter $H$ less than 1/2. We also construct superefficient James-Stein type estimators which dominate,…
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each…
This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We construct a structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the reachability set of a…