REVIEW 1 cited by
A rank-based distance for interval modules and Wasserstein stability of persistence landscapes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Barcodes and persistence diagrams have a canonical one-parameter family of distances called Wasserstein distances. These distances depend on a choice of distance for interval modules. The usual choices are all Lipschitz equivalent. We observe that they may be written in terms of the dimension function. We instead define a distance for interval modules using the rank function. The rank function contains the information of dimension function and unlike the dimension function, also contains information on persistence. Using this distance, we show that persistence landscapes are stable with respect to the 1-Wasserstein distance. This gives us a 1-Lipschitz embedding of persistence diagrams with the 1-Wasserstein distance into a Banach space given by an $L^1$ function space, and also provides a lower bound for the 1-Wasserstein distance. In addition, we give a stability theorem for the mapping from chains to barcodes. This result leads to a heuristic for truncating infinite bars.
Forward citations
Cited by 1 Pith paper
-
A Hilbert space embedding of persistence diagrams and barcodes
For every 1≤p≤∞, the persistence landscape is a 1-Lipschitz embedding from p-finite countable barcodes and persistence diagrams with a new p-Wasserstein distance into L^p.
Discussion (0). Continue with ORCID to comment.