Notes on an Elementary Proof for the Stability of Persistence Diagrams
classification
🧮 math.AT
keywords
diagramsnotespersistenceproofstabilityelementaryself-containedshort
read the original abstract
These notes are a self-contained short proof of the stability of persistence diagrams.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells
Hourglass Persistence interleaves graph contractions and inclusions to produce more expressive and stable topological descriptors than standard persistent homology for learning on graphs, simplices, and cells.
-
Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells
Hourglass Persistence interleaves sequences of graph inclusions and contractions to produce more expressive topological features than standard persistent homology for learning on graphs and higher-order complexes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.