Metrics for generalized persistence modules

Abstract

We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of examples, inverse-image persistence modules, which occur whenever a topological space is mapped to a metric space. Several standard theories of persistence and their stability can be described in this framework. This includes the classical case of sublevelset persistent homology. We introduce a distinction between `soft' and `hard' stability theorems. While our treatment is direct and elementary, the approach can be explained abstractly in terms of monoidal functors.

Final version; no changes from previous version. Published online Oct 2014 in Foundations of Computational Mathematics. Print version to appear

References in corpus (1)

• The structure and stability of persistence modules

Cited by in corpus (57)

• A roadmap for the computation of persistent homology
• Interactive Visualization of 2-D Persistence Modules
• Generalized Persistence Diagrams
• Algebraic Stability of Zigzag Persistence Modules
• Categorified Reeb Graphs
• A Structural Average of Labeled Merge Trees for Uncertainty Visualization
• Multidimensional Persistence and Noise
• The ${\ell }^{\infty }$-Cophenetic Metric for Phylogenetic Trees as an Interleaving Distance
• A Brief History of Persistence
• Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
• Cech Closure Spaces: A Unified Framework for Discrete and Continuous Homotopy
• Wasserstein Stability for Persistence Diagrams
• Evolutionary homology on coupled dynamical systems
• Convergence between Categorical Representations of Reeb Space and Mapper
• Topological spaces of persistence modules and their properties
• Graded persistence diagrams and persistence landscapes
• Magnitude meets persistence. Homology theories for filtered simplicial sets
• Universality of persistence diagrams and the bottleneck and Wasserstein distances
• Interleaving and Gromov-Hausdorff distance
• Homological Algebra for Persistence Modules
• Persistent homology of quantum entanglement
• Intrinsic Interleaving Distance for Merge Trees
• Higher interpolation and extension for persistence modules
• Weighted Persistent Homology
• Hochschild homology, and a persistent approach via connectivity digraphs
• Sparse Dowker Nerves
• Homotopy, homology, and persistent homology using closure spaces
• Exact weights, path metrics, and algebraic Wasserstein distances
• Persistent homology and microlocal sheaf theory
• A family of metrics from the truncated smoothing of Reeb graphs
• Stable Invariants for Multiparameter Persistence
• $P$-persistent homology of finite topological spaces
• Universal Distances for Extended Persistence
• The Representation Theorem of Persistent Homology Revisited and Generalized
• The Fiber of the Persistence Map for Functions on the Interval
• Metric Limits in Categories with a Flow
• Multiparameter Persistence Landscapes
• Generalized persistence analysis based on stable rank invariant
• Topological Data Analysis and Cosheaves
• $A_{\infty }$ persistent homology estimates the topology from pointcloud datasets
• Quiver Signal Processing (QSP)
• Stability for Inference with Persistent Homology Rank Functions
• Nonparametric Risk Assessment and Density Estimation for Persistence Landscapes
• Structure and Interleavings of Relative Interlevel Set Cohomology
• The Shift-Dimension of Multipersistence Modules
• Sparse Filtered Nerves
• A Framework for Algorithm Stability
• Convolution of Persistence Modules
• Local Equivalence of Metrics for Multiparameter Persistence Modules
• Stability for layer points
• Local Versus Global Distances for Zigzag Persistence Modules
• Finite Mixture Model of Nonparametric Density Estimation using Sampling Importance Resampling for Persistence Landscape
• Reeb Graph Metrics from the Ground Up
• ${\ell }^p$-Distances on Multiparameter Persistence Modules
• Distributions of Matching Distances in Topological Data Analysis
• Bounding the Interleaving Distance for Mapper Graphs with a Loss Function
• Stability and Extension of Steady and Ranging Persistence