Wasserstein Stability for Persistence Diagrams
read the original abstract
The stability of persistence diagrams is among the most important results in applied and computational topology. Most results in the literature phrase stability in terms of the bottleneck distance between diagrams and the $\infty$-norm of perturbations. This has two main implications: it makes the space of persistence diagrams rather pathological and it is often provides very pessimistic bounds with respect to outliers. In this paper, we provide new stability results with respect to the $p$-Wasserstein distance between persistence diagrams. This includes an elementary proof for the setting of functions on sufficiently finite spaces in terms of the $p$-norm of the perturbations, along with an algebraic framework for $p$-Wasserstein distance which extends the results to wider class of modules. We also provide apply the results to a wide range of applications in topological data analysis (TDA) including topological summaries, persistence transforms and the special but important case of Vietoris-Rips complexes.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
Canopies: A Generalization of Vines and Vineyards for Parameterized Persistence
Canopies generalize vines and vineyards by tracking simplex pairs in filtered chain complexes instead of persistence diagram points, with proofs of homeomorphism and applications to multiplicity and monodromy.
-
From Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features
STRAND treats persistence diagrams as survival data to derive a calibrated two-sample test, interpretable effect sizes, and a 1-Wasserstein-stable feature vector from one representation.
-
The Walk-Length Filtration for Persistent Homology on Weighted Directed Graphs
Defines the walk-length filtration for persistent homology on directed graphs, establishes stability under a generalized L1-style network distance, supplies a computation algorithm, and compares it to the Dowker filtr...
-
Non-negative Matrix Factorisation with Topological Regularisation
Introduces a topological regularization framework for NMF that uses persistent homology to enforce desired structures in basis functions within a unified optimization objective.
-
Persistent Homology as a Morphological Signature of Fibrin Networks
Persistent homology analysis found no significant differences in fibrin network topology across the perioperative period or between standard and intervention groups in oesophageal cancer patients.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.