Persistent homology detects curvature

Abstract

In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals represent the "topological signal" and the short intervals represent "noise". We give evidence to dispute this thesis, showing that the short intervals encode geometric information. Specifically, we prove that persistent homology detects the curvature of disks from which points have been sampled. We describe a general computational framework for solving inverse problems using the average persistence landscape, a continuous mapping from metric spaces with a probability measure to a Hilbert space. In the present application, the average persistence landscapes of points sampled from disks of constant curvature results in a path in this Hilbert space which may be learned using standard tools from statistical and machine learning.

22 pages, corrections thanks to anonymous referees

Cited by in corpus (13)

• Topological data analysis distinguishes parameter regimes in the Anderson-Chaplain model of angiogenesis
• Spatial Applications of Topological Data Analysis: Cities, Snowflakes, Random Structures, and Spiders Spinning Under the Influence
• Fractal Dimension Estimation with Persistent Homology: A Comparative Study
• A topological perspective on weather regimes
• Persistent homology of quantum entanglement
• Persistent Magnitude
• Moduli Spaces of Morse Functions for Persistence
• Applications of Persistent Homology in Nuclear Collisions
• Machine learning and Topological data analysis identify unique features of human papillae in 3D scans
• Multi-Parameter Persistence Modules are Generically Indecomposable
• Detection of Small Holes by the Scale-Invariant Robust Density-Aware Distance (RDAD) Filtration
• Rigidity of terminal simplices in persistent homology
• Geometric Bounds for Persistence