DeepAI AI Chat
Log In Sign Up

Sketching Persistence Diagrams

by   Donald R. Sheehy, et al.

Given a persistence diagram with n points, we give an algorithm that produces a sequence of n persistence diagrams converging in bottleneck distance to the input diagram, the ith of which has i distinct (weighted) points and is a 2-approximation to the closest persistence diagram with that many distinct points. For each approximation, we precompute the optimal matching between the ith and the (i+1)st. Perhaps surprisingly, the entire sequence of diagrams as well as the sequence of matchings can be represented in O(n) space. The main approach is to use a variation of the greedy permutation of the persistence diagram to give good Hausdorff approximations and assign weights to these subsets. We give a new algorithm to efficiently compute this permutation, despite the high implicit dimension of points in a persistence diagram due to the effect of the diagonal. The sketches are also structured to permit fast (linear time) approximations to the Hausdorff distance between diagrams – a lower bound on the bottleneck distance. For approximating the bottleneck distance, sketches can also be used to compute a linear-size neighborhood graph directly, obviating the need for geometric data structures used in state-of-the-art methods for bottleneck computation.


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...

On Computing a Center Persistence Diagram

Given a set of persistence diagrams P_1,..., P_m, for the data reduction...

From Geometry to Topology: Inverse Theorems for Distributed Persistence

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

A Sparse Delaunay Filtration

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

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...

Residuum-Condition Diagram and Reduction of Over-Complete Endmember-Sets

Extracting reference spectra, or endmembers (EMs) from a given multi- or...