Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Curvature Sets Over Persistence Diagrams (2103.04470v5)

Published 7 Mar 2021 in math.AT and math.MG

Abstract: We study a family of invariants of compact metric spaces that combines the Curvature Sets defined by Gromov in the 1980s with Vietoris-Rips Persistent Homology. For given integers $k\geq 0$ and $n\geq 1$ we consider the dimension $k$ Vietoris-Rips persistence diagrams of \emph{all} subsets of a given metric space with cardinality at most $n$. We call these invariants \emph{persistence sets} and denote them as $\mathbf{D}{n,k}\textrm{VR}$. We establish that (1) computing these invariants is often 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. 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 $\mathbf{D}{4,1}\textrm{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$ with quadratic time complexity as opposed to the much higher cost incurred by the usual algebraic algorithms relying on matrix reduction.

Citations (7)

Summary

We haven't generated a summary for this paper yet.