Related papers: Approximating the parallel transport of an induced…
Connections on principal bundles play a fundamental role in expressing the equations of motion for mechanical systems with symmetry in an intrinsic fashion. A discrete theory of connections on principal bundles is constructed by introducing…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
The present work provides a mathematically rigorous account on super fiber bundle theory, connection forms and their parallel transport, that ties together various approaches. We begin with a detailed introduction to super fiber bundles. We…
Branched Optimal Transport (BOT) is a generalization of optimal transport in which transportation costs along an edge are subadditive. This subadditivity models an increase in transport efficiency when shipping mass along the same route,…
The axiomatic approach to parallel transport theory is partially discussed. Bijective correspondences between the sets of connections, (axiomatically defined) parallel transports, and transports along paths satisfying some additional…
This article presents a purely functional-analytic construction of the concept of stochastic parallel transport in Hermitian bundles over Riemannian manifolds. As a byproduct, we also obtain a form of the Feynman-Kac formula in vector…
We define functorial isomorphisms of parallel transport along etale paths for a class of vector bundles on a p-adic curve. All bundles of degree zero whose reduction is strongly semistable belong to this class. In particular, they give rise…
We provide an extension of the Gromov--Zimmer Embedding Theorem for Cartan geometries of [3] to tractor bundles carrying any invariant connection, including tractor connections and prolongation connections of first BGG operators for…
Transportation cost is an attractive similarity measure between probability distributions due to its many useful theoretical properties. However, solving optimal transport exactly can be prohibitively expensive. Therefore, there has been…
We develop a theory of \'etale parallel transport for vector bundles with numerically flat reduction on a $p$-adic variety. This construction is compatible with natural operations on vector bundles, Galois equivariant and functorial with…
A vector bundle with connection over a supermanifold leads naturally to a notion of parallel transport along superpaths. In this note we show that {\it every} such parallel transport along superpaths comes form a vector bundle with…
We consider stable and semistable principal bundles over a smooth projective real algebraic curve, equipped with a real or pseudo-real structure in the sense of Atiyah. After fixing suitable topological invariants, one can build a suitable…
Optimization on Hadamard manifolds -- the natural Riemannian setting for globally geodesically convex problems -- relies on exponential maps to retract tangent vectors and parallel transport to connect tangent spaces across the manifold.…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
Optimal Transport is a popular distance metric for measuring similarity between distributions. Exact algorithms for computing Optimal Transport can be slow, which has motivated the development of approximate numerical solvers (e.g. Sinkhorn…
We analyze a family of Runge-Kutta based quadrature algorithms for the approximation of the gramians of linear time invariant dynamical systems. The approximated gramians are used to obtain an approximate balancing transformation similar to…
Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…
In this paper, we construct a category of short exact sequences of vector bundles and prove that it is equivalent to the category of double vector bundles. Moreover, operations on double vector bundles can be transferred to operations on…
We introduce stronger notions for approximate single-source shortest-path distances, show how to efficiently compute them from weaker standard notions, and demonstrate the algorithmic power of these new notions and transformations. One…
Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms…