Stabilizing decomposition of multiparameter persistence modules

MaRDI QIDQ6510264arXivFDO

Authors Håvard Bakke Bjerkevik

Mathematics Subject Classification ID

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

Abstract: While decomposition of one-parameter persistence modules behaves nicely, as demonstrated by the algebraic stability theorem, decomposition of multiparameter modules is well known to be unstable in a certain precise sense. Until now, it has not been clear that there is any way to build a meaningful stability theory for multiparameter module decomposition, as naive attempts to do this tend to fail. We introduce tools and definitions, in particular $epsilon$-refinements and the $epsilon$-erosion neighborhood of a module, to make sense of the question of how to build such a theory. Then we show a stability theorem saying that $epsilon$-interleaved modules with maximal pointwise dimension $r$ have a common $2repsilon$-refinement, which can be interpreted as an approximate $2repsilon$-matching of indecomposables. We also show that the $2repsilon$ appearing in the theorem is close to optimal. Finally, we discuss the possibility of strengthening the stability theorem for modules that decompose into pointwise low-dimensional summands, and pose a conjecture phrased purely in terms of basic linear algebra and graph theory that seems to capture the difficulty of doing this. This conjecture is also relevant for other areas of multipersistence, like the computational complexity of approximating the interleaving distance.

This page was built for publication: Stabilizing decomposition of multiparameter persistence modules

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