Local Versus Global Distances for Zigzag Persistence Modules

DOI10.1007/978-3-030-95519-9_3MaRDI QIDQ6315915arXivFDO

Authors Ellen Gasparovic, Maria Gommel, Emilie Purvine, R. Sazdanović, Bei Wang, Yusu Wang, Lori Ziegelmeier

Publication date 19 March 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-95519-9_3

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31)

arXiv classification

cs.CG math.AT

Abstract: This short note establishes explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance between two zigzag persistence modules restricted to an interval is always bounded above by the distance between the unrestricted versions. While this result is not surprising, it could have different practical implications. We give two related applications for metric graph distances, as well as an extension for the matching distance between multiparameter persistence modules.

This page was built for publication: Local Versus Global Distances for Zigzag Persistence Modules

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