# Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutions

@article{Botnan2021SignedBF, title={Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions and Rank-Exact Resolutions}, author={Magnus Bakke Botnan and Steffen Oppermann and Steve Oudot}, journal={ArXiv}, year={2021}, volume={abs/2107.06800} }

In this paper we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode encodes the rank invariant as a Z-linear combination of rank invariants of indicator modules supported on segments in the poset. It can also be enriched to encode the generalized rank invariant as a Z-linear…

## Figures from this paper

## 8 Citations

Computing Generalized Rank invariant for 2-Parameter Persistence Modules via Zigzag Persistence and its Applications

- Computer Science, MathematicsArXiv
- 2021

The generalized rank over a finite interval I of a Z2-indexed persistence module M is equal to the generalized rank of the zigzag module that is induced on a certain path in I tracing mostly its boundary by restricting the bifiltration inducing M to that path.

On the stability of multigraded Betti numbers and Hilbert functions

- Computer Science, MathematicsArXiv
- 2021

The stability result is a combination of Hilbert's syzygy theorem, Bjerkevik's bottleneck stability for free modules, and a novel stability result for projective resolutions, and the notion of matching is inspired by recent work on signed barcodes and allows matching of bars of the same module in homological degrees of different parity.

Amplitudes on abelian categories

- Mathematics
- 2021

The use of persistent homology in applications is justified by the validity of certain stability results. At the core of such results is a notion of distance between the invariants that one…

The Generalized Persistence Diagram Encodes the Bigraded Betti Numbers

- Mathematics
- 2021

We show that the generalized persistence diagram by Kim and Mémoli encodes the bigraded Betti numbers of finite 2-parameter persistence modules. More interestingly, the way to read off the bigraded…

Homological approximations in persistence theory

- Computer Science, MathematicsArXiv
- 2021

It is shown that both the dimension vector and rank invariant are equivalent to homological invariants taking values in groups generated by spread modules, and that the free abelian group generated by the “single-source” spread modules gives rise to a new invariant which is finer than the rank invariants.

$\ell^p$-Distances on Multiparameter Persistence Modules

- Mathematics, Computer Science
- 2021

It is shown that on 1or 2-parameter persistence modules over prime fields, dp I is the universal metric satisfying a natural stability property; this result extends a stability result of Skraba and Turner for the p-Wasserstein distance on barcodes in the 1- parameter case, and is also a close analogue of a universality property for the interleaving distance given by the second author.

On the consistency and asymptotic normality of multiparameter persistent Betti numbers

- Mathematics
- 2021

The persistent Betti numbers are used in topological data analysis to infer the scales at which topological features appear and disappear in the filtration of a topological space. Most commonly by…

Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces

- Mathematics
- 2020

Persistence diagrams, an important summary in topological data analysis, consist of a set of ordered pairs, each with positive multiplicity. Persistence diagrams are obtained via Möbius inversion and…

## References

SHOWING 1-10 OF 33 REFERENCES

Generalized persistence diagrams for persistence modules over posets

- Computer Science, MathematicsJ. Appl. Comput. Topol.
- 2021

The barcode of any interval decomposable persistence modules of finite dimensional vector spaces can be extracted from the rank invariant by the principle of inclusion-exclusion, leading to a promotion of Patel's semicontinuity theorem about type $\mathcal{A}$ persistence diagram to Lipschitz continuity theorem for the category of sets.

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules

- Mathematics, Computer ScienceArXiv
- 2019

A generalization of the persistence algorithm based on a generalized matrix reduction technique that runs in $O(n^{2\omega})$ time where $\omega<2.373$ is the exponent for matrix multiplication.

Homological approximations in persistence theory

- Computer Science, MathematicsArXiv
- 2021

It is shown that both the dimension vector and rank invariant are equivalent to homological invariants taking values in groups generated by spread modules, and that the free abelian group generated by the “single-source” spread modules gives rise to a new invariant which is finer than the rank invariants.

Interactive Visualization of 2-D Persistence Modules

- Mathematics, Computer ScienceArXiv
- 2015

The goal of this work is to extend the standard persistent homology pipeline for exploratory data analysis to the 2-D persistence setting, in a practical, computationally efficient way, with a novel data structure based on planar line arrangements.

On Approximation of $2$D Persistence Modules by Interval-decomposables

- Mathematics
- 2019

In this work, we propose a new invariant for $2$D persistence modules called the compressed multiplicity and show that it generalizes the notions of the dimension vector and the rank invariant. In…

The rank invariant stability via interleavings

- Mathematics, Computer ScienceArXiv
- 2014

A lower bound for the interleaving distance on persistence modules is given in terms of matching distance of rank invariants, and the internal stability of the rank invariant is proved in Terms of interleavings.

Generalized persistence diagrams

- Mathematics, Computer ScienceJ. Appl. Comput. Topol.
- 2018

The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer is generalized to the setting of constructible persistence modules valued in a symmetric monoidal category and a second type of persistence diagram is defined, which enjoys a stronger stability theorem.

Multiparameter Persistence Image for Topological Machine Learning

- Computer ScienceNeurIPS
- 2020

This work introduces a new descriptor for multiparameter persistence, which it calls the Multiparameter Persistence Image, that is suitable for machine learning and statistical frameworks, is robust to perturbations in the data, has finer resolution than existing descriptors based on slicing, and can be efficiently computed on data sets of realistic size.

Persistence Images: A Stable Vector Representation of Persistent Homology

- Computer Science, MathematicsJ. Mach. Learn. Res.
- 2017

This work converts a PD to a finite-dimensional vector representation which it is called a persistence image, and proves the stability of this transformation with respect to small perturbations in the inputs.

Sliced Wasserstein Kernel for Persistence Diagrams

- Computer Science, MathematicsICML
- 2017

A new kernel for PDs is defined, which is not only provably stable but also discriminative (with a bound depending on the number of points in the PDs) w.r.t. the first diagram distance between PDs.