A comparison framework for interleaved persistence modules

DOI10.1007/S41468-019-00026-XMaRDI QIDQ2324604zbMATH OpenOpenAlexWikidataFDO

Authors Shaun Harker, Miroslav Kramár, Rachel Levanger, K. Mischaikow

Publication date 11 September 2019

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.06725, http://europepmc.org/articles/pmc7044718

zbMATH Keywords

error boundspersistence diagrampersistence modulepersistent homologytopological data analysis

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Simplicial sets and complexes in algebraic topology (55U10) Error analysis and interval analysis (65G99)

Abstract: We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $mathbbR$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show how the generalized algebraic stability theorem enables the computation of rigorous error bounds in the space of persistence diagrams that go beyond the typical formulation in terms of bottleneck (or log bottleneck) distance.

Review text

The main contribution of the paper is its generalization of both the Bauer-Lesnick matching theorem and the algebraic stability theorem. As application, some computation of rigorous error bounds in the space of persistence diagrams are done

Recommendations

• Induced matchings of barcodes and the algebraic stability of persistence
• Metrics for generalized persistence modules
• Induced matchings and the algebraic stability of persistence barcodes
• The theory of the interleaving distance on multidimensional persistence modules
• Bottleneck stability for generalized persistence diagrams

Cites work

• Analysis of Kolmogorov flow and Rayleigh-Bénard convection using persistent homology
• Approximating persistent homology in Euclidean space through collapses
• Categorification of persistent homology
• Computational topology. An introduction
• Computing persistent homology
• Computing topological persistence for simplicial maps (extended abstract)
• Decomposition of pointwise finite-dimensional persistence modules.
• Efficient and robust persistent homology for measures
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 841435 (Why is no real title available?)
• Induced matchings of barcodes and the algebraic stability of persistence
• Metrics for generalized persistence modules
• Persistence diagrams as diagrams: a categorification of the stability theorem
• Persistence theory. From quiver representations to data analysis
• Proximity of persistence modules and their diagrams
• Stability of persistence diagrams
• Survey article: an elementary illustrated introduction to simplicial sets
• The structure and stability of persistence modules

Cited in

(12)

• The rank invariant stability via interleavings
• Persistence Steenrod modules
• Induced matchings and the algebraic stability of persistence barcodes
• scientific article; zbMATH DE number 90778 (Why is no real title available?)
• Induced matchings of barcodes and the algebraic stability of persistence
• Quantifying genetic innovation: mathematical foundations for the topological study of reticulate evolution
• Conley index approach to sampled dynamics
• Bottleneck stability for generalized persistence diagrams
• Determining homology of an unknown space from a sample
• scientific article; zbMATH DE number 7692244 (Why is no real title available?)
• Exact weights, path metrics, and algebraic Wasserstein distances
• Universal distances for extended persistence

This page was built for publication: A comparison framework for interleaved persistence modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324604)