The space of barcode bases for persistence modules

DOI10.1007/S41468-022-00094-6MaRDI QIDQ6102898zbMATH OpenOpenAlexWikidataFDO

Authors Emile Jacquard, Vidit Nanda, U. Tillmann

Publication date 23 June 2023

Published in Journal of Applied and Computational Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2111.03700

zbMATH Keywords

algebra of persistence modulesbarcode basispersistence modulequiver representation

Mathematics Subject Classification ID

Representations of quivers and partially ordered sets (16G20) Persistent homology and applications, topological data analysis (55N31)

Abstract: The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special form. Here we describe a new algorithm for computing barcodes which also keeps track of, and outputs, such a change of basis. Our main result is an explicit characterisation of the group of transformations that sends one barcode basis to another. Armed with knowledge of the entire space of barcode bases, we are able to show that any map of persistence modules can be represented via a partial matching between bars provided that neither source nor target admits nested bars in its barcode. We also generalise the algorithm and results described above to work for zizag modules.

Review text

Persistent homology has been gaining traction as a method for applied algebraic topology in recent decades. One core question the field has been exploring is the complete invariant called \textit{barcodes} that was introduced early on: indecomposable modules in the representation theory underlying persistent homology can be completely characterised by the start- and end-value of the parameter that is allowed to vary in the persistent homology constructions. Hence a decomposition of a given persistence module is fully described by a (multi-)set of ordered pairs of parameter values. This paper studies the entirety of the space of barcode bases for a given persistence module, and transformations for performing basis changes within this space. The authors extract a description of the appropriate symmetry groups (products of general linear groups) and algorithms for putting an arbitrary set of (appropriate) matrices on a barcode representation form. The authors also leverage their understanding of this space of bases to push further on our understanding of maps between persistence modules. This has been studied before, in preprints [\textit{P. Skraba} and \textit{M. Vejdemo-Johansson}, ``Persistence modules: algebra and algorithms, Preprint, \url{arXiv:1302.2015}] and in papers on algebraic approaches to the stability of persistent homology [\textit{U. Bauer} and \textit{M. Lesnick}, SoCG 2014, 355--364 (2014; Zbl 1395.68289); J. Comput. Geom. 6, No. 2, 162--191 (2015; Zbl 1405.68398)] where kernels and images of maps between persistence modules were studied in terms of matching these \textit{bars} between the decompositions of the source and target persistence modules. In this paper, the authors show that as long as no bar fully contains (as an interval of real numbers) another bar, the maps are fully determined by such matchings of bars, and when such contained bars are present, they characterize the ways in which the corresponding maps end up ambiguously defined.

Recommendations

• Induced matchings of barcodes and the algebraic stability of persistence
• Induced matchings and the algebraic stability of persistence barcodes
• Persistence Steenrod modules
• Decomposition of pointwise finite-dimensional persistence modules.
• An entropy-based persistence barcode

Cites work

• Computing persistent homology
• Homological connectivity of random 2-complexes
• Matrix method for persistence modules on commutative ladders of finite type
• Persistence modules on commutative ladders of finite type
• Realizations of indecomposable persistence modules of arbitrarily large dimension
• Representations of quivers.
• Zigzag persistence

Cited in

(8)

• An entropy-based persistence barcode
• A framework for differential calculus on persistence barcodes
• Persistent extensions and analogous bars: data-induced relations between persistence barcodes
• Stratifying the space of barcodes using Coxeter complexes
• Combinatorial methods for barcode analysis
• Harder-Narasimhan filtrations of persistence modules
• Additive partial matchings for persistent homology
• Additive partial matchings induced by persistence maps

This page was built for publication: The space of barcode bases for persistence modules

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