arXiv Analytics

Sign in

arXiv:2206.08818 [math.AT]AbstractReferencesReviewsResources

Projected distances for multi-parameter persistence modules

Nicolas Berkouk, Francois Petit

Published 2022-06-17Version 1

We introduce the new notions of projected distances and projected barcodes for multi-parameter persistence modules. Projected barcodes are defined as derived pushforward of persistence modules onto $\mathbb{R}$. Projected distances come in two flavors: the integral sheaf metrics (ISM) and the sliced convolution distances (SCD). We conduct a systematic study of the stability of projected barcodes and show that the fibered barcode is a particular instance of projected barcodes. We prove that the ISM and the SCD provide lower bounds for the convolution distance. Furthermore, we show that the $\gamma$-linear ISM and the $\gamma$-linear SCD which are projected distances tailored for $\gamma$-sheaves can be computed using TDA software dedicated to one-parameter persistence modules. Moreover, the time and memory complexity required to compute these two metrics are advantageous, since our approach does not require computing nor storing an entire $n$-persistence module.

Related articles: Most relevant | Search more
arXiv:1812.09085 [math.AT] (Published 2018-12-21)
Exact computation of the matching distance on 2-parameter persistence modules
arXiv:2210.12868 [math.AT] (Published 2022-10-23)
Computing the Matching Distance of 2-Parameter Persistence Modules from Critical Values
arXiv:2306.06540 [math.AT] (Published 2023-06-10)
K-Theory of Multi-parameter Persistence Modules: Additivity