Curvature Sets Over Persistence Diagrams

Abstract

AbstractWe study a family of invariants of compact metric spaces that combines the Curvature Sets defined by Gromov in the 1980 s with Vietoris–Rips Persistent Homology. For given integers $$k\ge 0$$ k ≥ 0 and $$n\ge 1$$ n ≥ 1 we consider the dimension k Vietoris–Rips persistence diagrams of all subsets of a given metric space with cardinality at most n. We call these invariants persistence sets and denote them as $${\textbf{D}}_{n,k}^{\textrm{VR}}$$ D n , k VR . We first point out that this family encompasses the usual Vietoris–Rips diagrams. We then establish that (1) for certain range of values of the parameters n and k, computing these invariants is significantly more efficient than computing the usual Vietoris–Rips persistence diagrams, (2) these invariants have very good discriminating power and, in many cases, capture information that is imperceptible through standard Vietoris–Rips persistence diagrams, and (3) they enjoy stability properties analogous to those of the usual Vietoris–Rips persistence diagrams. We precisely characterize some of them in the case of spheres and surfaces with constant curvature using a generalization of Ptolemy’s inequality. We also identify a rich family of metric graphs for which $${\textbf{D}}_{4,1}^{\textrm{VR}}$$ D 4 , 1 VR fully recovers their homotopy type by studying split-metric decompositions. Along the way we prove some useful properties of Vietoris–Rips persistence diagrams using Mayer–Vietoris sequences. These yield a geometric algorithm for computing the Vietoris–Rips persistence diagram of a space X with cardinality $$2k+2$$ 2 k + 2 with quadratic time complexity as opposed to the much higher cost incurred by the usual algebraic algorithms relying on matrix reduction.