DeepAI AI Chat
Log In Sign Up

Geodesics in persistence diagram space

by   Samir Chowdhury, et al.
The Ohio State University

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex combination. More specifically, given two persistence diagrams and a choice of metric, one obtains a bijection realizing the distance between the diagrams, and uses this bijection to linearly interpolate from one diagram to another. We prove that for several families of metrics, every geodesic in persistence diagram space arises as such a convex combination. For certain other choices of metrics, we explicitly construct infinite families of geodesics that cannot have this form.


page 1

page 2

page 3

page 4


Universality of the Bottleneck Distance for Extended Persistence Diagrams

The extended persistence diagram is an invariant of piecewise linear fun...

Intrinsic persistent homology via density-based metric learning

We address the problem of estimating intrinsic distances in a manifold f...

Realizable piecewise linear paths of persistence diagrams with Reeb graphs

Reeb graphs are widely used in a range of fields for the purposes of ana...

Anomaly Detection with the Voronoi Diagram Evolutionary Algorithm

This paper presents the Voronoi diagram-based evolutionary algorithm (Vo...

Persistence B-Spline Grids: Stable Vector Representation of Persistence Diagrams Based on Data Fitting

Over the last decades, many attempts have been made to optimally integra...

A Sparse Delaunay Filtration

We show how a filtration of Delaunay complexes can be used to approximat...

From Geometry to Topology: Inverse Theorems for Distributed Persistence

What is the "right" topological invariant of a large point cloud X? Prio...