Edit Distance and Persistence Diagrams Over Lattices

Abstract

We build a functorial pipeline for persistent homology. The input to this pipeline is a filtered simplicial complex indexed by any finite metric lattice and the output is a persistence diagram defined as the Möbius inversion of its birth-death function. We adapt the Reeb graph edit distance to each of our categories and prove that both functors in our pipeline are $1$-Lipschitz making our pipeline stable. Our constructions generalize the classical persistence diagram and, in this setting, the bottleneck distance is strongly equivalent to the edit distance.

Theorem 8.4 is vacuous. We've added an erratum section that includes an example illustrating why this is the case and propose a solution

Cited by in corpus (12)

• Homological approximations in persistence theory
• Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces
• On the stability of multigraded Betti numbers and Hilbert functions
• The algebraic stability for persistent Laplacians
• Capturing Dynamics of Time-Varying Data via Topology
• Multidimensional Persistence Module Classification via Lattice-Theoretic Convolutions
• Multi-Parameter Persistence Modules are Generically Indecomposable
• Combinatorial Persistent Homology Transform
• A Faithful Discretization of the Verbose Persistent Homology Transform
• Harder-Narasimhan Filtrations of Persistence Modules
• Poincaré Duality for Generalized Persistence Diagrams of (co)Filtrations
• ${\ell }^p$-Distances on Multiparameter Persistence Modules