Related papers: Transport information geometry I: Riemannian calcu…

The manifold of empirical mean values of statistical data ad infinitum has a geometric shape that depends on the probability measure that governs the generating model. Large deviation theory produces entropy functions that depend on both…

In this paper, we develop a new classification method for manifold-valued data in the framework of probabilistic learning vector quantization. In many classification scenarios, the data can be naturally represented by symmetric positive…

We study a natural Wasserstein gradient flow on manifolds of probability distributions with discrete sample spaces. We derive the Riemannian structure for the probability simplex from the dynamical formulation of the Wasserstein distance on…

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as…

The space of all probability measures having positive density function on a connected compact smooth manifold $M$, denoted by $\mathcal{P}(M)$, carries the Fisher information metric $G$. We define the geometric mean of probability measures…

We derive mean-field information Hessian matrices on finite graphs. The "information" refers to entropy functions on the probability simplex. And the "mean-field" means nonlinear weight functions of probabilities supported on graphs. These…

An optimal transport path may be viewed as a geodesic in the space of probability measures under a suitable family of metrics. This geodesic may exhibit a tree-shaped branching structure in many applications such as trees, blood vessels,…

Let (M,g) be a compact, connected and oriented Riemannian manifold. We denote D the space of smooth probability density functions on M. In this paper, we show that the Frechet manifold D is equipped with a Riemannian metric g^{D} and an…

We study the optimal transportation mapping $\nabla \Phi : \mathbb{R}^d \mapsto \mathbb{R}^d$ pushing forward a probability measure $\mu = e^{-V} \ dx$ onto another probability measure $\nu = e^{-W} \ dx$. Following a classical approach of…

We introduce a novel concept of coarse extrinsic curvature for Riemannian submanifolds, inspired by Ollivier's notion of coarse Ricci curvature. This curvature is derived from the Wasserstein 1-distance between probability measures…

We describe how to approximate the Riemann curvature tensor as well as sectional curvatures on possibly infinite-dimensional shape spaces that can be thought of as Riemannian manifolds. To this end, we extend the variational time…

This paper aims at building the theoretical foundations for manifold learning algorithms in the space of absolutely continuous probability measures $\mathcal{P}_{\mathrm{a.c.}}(\Omega)$ with $\Omega$ a compact and convex subset of…

We develop a family of infinite-dimensional Banach manifolds of measures on an abstract measurable space, employing charts that are "balanced" between the density and log-density functions. The manifolds, $(\tilde{M}_{\lambda},\lambda\in…

The motion of a quantum particle constrained to a two-dimensional non-compact Riemannian manifold with non-trivial metric can be described by a flat-space Schroedinger-type equation at the cost of introducing local mass and metric and…

In this paper we consider the space of those probability distributions which maximize the $q$-R\'enyi entropy. These distributions have the same parameter space for every $q$, and in the $q=1$ case these are the normal distributions. Some…

We illustrate connections between differential geometry on finite simple graphs G=(V,E) and Riemannian manifolds (M,g). The link is that curvature can be defined integral geometrically as an expectation in a probability space of…

Choosing the Fisher information as the metric tensor for a Riemannian manifold provides a powerful yet fundamental way to understand statistical distribution families. Distances along this manifold become a compelling measure of statistical…

We characterize the complexity of geodesic paths on a curved statistical manifold M_{s} through the asymptotic computation of the information geometric complexity V_{M_{s}} and the Jacobi vector field intensity J_{M_{s}}. The manifold M_{s}…

This introductory text arises from a lecture given in G\"oteborg, Sweden, given by the first author and is intended for undergraduate students, as well as for any mathematically inclined reader wishing to explore a synthesis of ideas…

Optimization under the symplecticity constraint is an approach for solving various problems in quantum physics and scientific computing. Building on the results that this optimization problem can be transformed into an unconstrained problem…