Efficient Approximation of the Matching Distance for 2-Parameter Persistence

DOI10.4230/LIPICS.SOCG.2020.53MaRDI QIDQ6060004zbMATH OpenOpenAlexFDO

Authors Michael Kerber, Arnur Nigmetov

Publication date 2 November 2023

Full work available at URL https://arxiv.org/abs/1912.05826

zbMATH Keywords

approximation algorithmmatching distancemulti-parameter persistence

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired precision $epsilon>0$. Our approach is based on a quad-tree refinement strategy introduced by Biasotti et al., but we recast their approach entirely in geometric terms. This point of view leads to several novel observations resulting in a practically faster algorithm. We demonstrate this speed-up by experimental comparison and provide our code in a public repository which provides the first efficient publicly available implementation of the matching distance.

Recommendations

• Exact computation of the matching distance on 2-parameter persistence modules
• Exact computation of the matching distance on 2-parameter persistence modules
• Exact computation of the matching distance on 2-parameter persistence modules
• Multi-scale approximation of the matching distance for shape retrieval
• A new approximation algorithm for the matching distance in multidimensional persistence

Cited in

(8)

• On the bottleneck stability of rank decompositions of multi-parameter persistence modules
• Geometry of the matching distance for 2D filtering functions
• scientific article; zbMATH DE number 7700596 (Why is no real title available?)
• On the Stability of Multigraded Betti Numbers and Hilbert Functions
• Topological data analysis on simple English Wikipedia articles
• Exact computation of the matching distance on 2-parameter persistence modules
• Compression for \(2\)-parameter persistent homology
• Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification

This page was built for publication: Efficient Approximation of the Matching Distance for 2-Parameter Persistence

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