Continuation of Point Clouds via Persistence Diagrams

Abstract

In this paper, we present a mathematical and algorithmic framework for the continuation of point clouds by persistence diagrams. A key property used in the method is that the persistence map, which assigns a persistence diagram to a point cloud, is differentiable. This allows us to apply the Newton-Raphson continuation method in this setting. Given an original point cloud $P$, its persistence diagram $D$, and a target persistence diagram $D^{\prime }$, we gradually move from $D$ to $D^{\prime }$, by successively computing intermediate point clouds until we finally find a point cloud $P^{\prime }$ having $D^{\prime }$ as its persistence diagram. Our method can be applied to a wide variety of situations in topological data analysis where it is necessary to solve an inverse problem, from persistence diagrams to point cloud data.

References in corpus (1)

• Hierarchical structures of amorphous solids characterized by persistent homology

Cited by in corpus (8)

• Vietoris-Rips Persistent Homology, Injective Metric Spaces, and The Filling Radius
• Optimizing persistent homology based functions
• Barcode Embeddings for Metric Graphs
• Optimisation of Spectral Wavelets for Persistence-based Graph Classification
• Inferring traits of hyperuniformity from local structures via persistent homology
• Topological Graph Neural Networks
• Topological Node2vec: Enhanced Graph Embedding via Persistent Homology
• Improving Metric Dimensionality Reduction with Distributed Topology