Optimal Parallel Transport on Connection Graphs: Generalizing Wasserstein Distance and the Beckmann Problem

This paper proposes a novel framework for studying optimal parallel transport between vector fields on connection graphs, which generalizes the Wasserstein distance and the Beckmann problem from standard graphs to connection graphs.