Universality of persistence diagrams and the bottleneck and Wasserstein distances
Abstract: We prove that persistence diagrams with the p-Wasserstein distance form the universal p-subadditive commutative monoid on an underlying metric space with a distinguished subset. This result applies to persistence diagrams, barcodes, and to multiparameter persistence modules. In addition, the 1-Wasserstein distance satisfies Kantorovich-Rubinstein duality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.