Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification

DOI10.1137/1.9781611977042.14MaRDI QIDQ6543142zbMATH OpenFDO

Authors Tamal K. Dey, Simon Zhang

Publication date 24 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Persistent homology and applications, topological data analysis (55N31) Approximation algorithms (68W25) Distance in graphs (05C12)

Recommendations

• Geometry helps to compare persistence diagrams
• Geometry Helps to Compare Persistence Diagrams
• Efficient and robust persistent homology for measures
• Efficient Approximation of the Matching Distance for 2-Parameter Persistence
• Adaptive approximation of persistent homology

This page was built for publication: Approximating 1-Wasserstein distance between persistence diagrams by graph sparsification

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