Local Versus Global Distances for Zigzag and Multi-Parameter Persistence Modules

Abstract

In this paper, we establish explicit and broadly applicable relationships between persistence-based distances computed locally and globally. In particular, we show that the bottleneck distance and the Wasserstein 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 potential practical implications. We give two related applications for metric graph distances, as well as an extension for the matching distance between multi-parameter persistence modules.