scientific article; zbMATH DE number 7700596

DOI10.4230/LIPICS.SEA.2021.14arXiv2104.07710MaRDI QIDQ6159902

Unnamed Author, Yusu Wang

Publication date: 23 June 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsWasserstein distanceoptimal transportpersistence diagrams

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Edit Distance and Persistence Diagrams over Lattices ⋮ Vector summaries of persistence diagrams for permutation-based hypothesis testing

Recommendations

• Conformal Wasserstein distances: comparing surfaces in polynomial time 👍 👎
• 1-Wasserstein distance on the standard simplex 👍 👎
• Universality of persistence diagrams and the bottleneck and Wasserstein distances 👍 👎
• On $\varepsilon $ approximations of persistence diagrams 👍 👎
• The Wasserstein distance and approximation theorems 👍 👎
• A New Approximation Algorithm for the Matching Distance in Multidimensional Persistence 👍 👎
• Approximation de la L1-distance de Wasserstein 👍 👎
• The Persistent Homology of Distance Functions under Random Projection 👍 👎
• Nonembeddability of persistence diagrams with $p>2$ Wasserstein metric 👍 👎
• Efficient Approximation of the Matching Distance for 2-Parameter Persistence 👍 👎

This page was built for publication: