Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams

DOI10.1007/S00454-023-00498-WarXiv2106.02538OpenAlexW3166214348MaRDI QIDQ6204774FDOQ6204774

Authors: Paweł Dłotko, Niklas Hellmer 

Publication date: 2 April 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: In topological data analysis (TDA), persistence diagrams have been a succesful tool. To compare them, Wasserstein and Bottleneck distances are commonly used. We address the shortcomings of these metrics and show a way to investigate them in a systematic way by introducing bottleneck profiles. This leads to a notion of discrete Prokhorov metrics for persistence diagrams as a generalization of the Bottleneck distance. They satisfy a stability result and bounds with respect to Wasserstein metrics. We provide algorithms to compute the newly introduced quantities and end with an discussion about experiments.

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

Recommendations

• Universality of persistence diagrams and the bottleneck and Wasserstein distances
• Describing topology on the set of persistence diagrams
• Nearly-doubling spaces of persistence diagrams
• Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces
• Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport

zbMATH Keywords

persistent homologytopological data analysisProkhorov distance

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40)

Cites Work

• Scikit-learn: machine learning in Python
• Probability measures on the space of persistence diagrams
• Computational topology. An introduction
• Robust statistics, hypothesis testing, and confidence intervals for persistent homology on metric measure spaces
• Computational optimal transport. With applications to data sciences
• On Choosing and Bounding Probability Metrics
• Decomposition of pointwise finite-dimensional persistence modules.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical Fourier analysis
• Topological spaces of persistence modules and their properties
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• Title not available (Why is that?)
• Geometry helps in bottleneck matching and related problems
• Persistence images: a stable vector representation of persistent homology
• Geometry helps to compare persistence diagrams
• A new entropy based summary function for topological data analysis
• Metrics and Stabilization in One Parameter Persistence

Cited In (2)

• Nearly-doubling spaces of persistence diagrams
• Nearly-doubling spaces of persistence diagrams

This page was built for publication: Bottleneck profiles and discrete Prokhorov metrics for persistence diagrams

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