Papers
Topics
Authors
Recent
Search
2000 character limit reached

Wasserstein Stability of Persistence Landscapes and Barcodes

Published 25 Sep 2025 in math.AT | (2509.20921v1)

Abstract: Barcodes form a complete set of invariants for interval decomposable persistence modules and are an important summary in topological data analysis. The set of barcodes is equipped with a canonical one-parameter family of metrics, the $p-$Wasserstein distances. However, the $p-$Wasserstein distances depend on a choice of a metric on the set of interval modules, and there is no canonical choice. One convention is to use the length of the symmetric difference between 2 intervals, which equals to the 1-norm of the difference between their Hilbert functions. We propose a new metric for interval modules based on the rank invariant instead of the dimension invariant. Our metric is topologically equivalent to the metrics induced by the $p-$norms on $\R2$. We establish stability results from filtered CW complexes to barcodes, as well as from barcodes to persistence landscapes. In particular, we show that vectorization via persistence landscapes is 1-Lipschitz with a sharp bound, with respect to the 1-Wasserstein distance on barcodes and the 1-norm on persistence landscapes.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.