scientific article; zbMATH DE number 7700596

DOI10.4230/LIPICS.SEA.2021.14MaRDI QIDQ6159902zbMATHFDO

Authors Yusu Wang

Publication date 23 June 2023

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

zbMATH Keywords

optimal transportWasserstein distanceapproximation algorithmspersistence diagrams

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Universality of persistence diagrams and the bottleneck and Wasserstein distances
• A new approximation algorithm for the matching distance in multidimensional persistence
• On \(\varepsilon \) approximations of persistence diagrams
• Nonembeddability of persistence diagrams with \(p>2\) Wasserstein metric
• The Wasserstein distance and approximation theorems
• The persistent homology of distance functions under random projection
• Efficient Approximation of the Matching Distance for 2-Parameter Persistence
• Conformal Wasserstein distances: comparing surfaces in polynomial time
• 1-Wasserstein distance on the standard simplex
• Approximation de la L1-distance de Wasserstein

Cited in

(3)

• Vector summaries of persistence diagrams for permutation-based hypothesis testing
• Embeddings of persistence diagrams into Hilbert spaces
• Edit Distance and Persistence Diagrams over Lattices

This page was built for publication:

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