Dissemin is shutting down on January 1st, 2025

Published in

arXiv, 2019

DOI: 10.48550/arxiv.1907.13495

Mathematics and Visualization, p. 3-17, 2020

DOI: 10.1007/978-3-030-43036-8_1

Links

Tools

Export citation

Search in Google Scholar

Hierarchies and Ranks for Persistence Pairs

Book chapter published in 2020 by Bastian Rieck ORCID, Filip Sadlo, Heike Leitte
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

We develop a novel hierarchy for zero-dimensional persistence pairs, i.e., connected components, which is capable of capturing more fine-grained spatial relations between persistence pairs. Our work is motivated by a lack of spatial relationships between features in persistence diagrams, leading to a limited expressive power. We build upon a recently-introduced hierarchy of pairs in persistence diagrams that augments the pairing stored in persistence diagrams with information about which components merge. Our proposed hierarchy captures differences in branching structure. Moreover, we show how to use our hierarchy to measure the spatial stability of a pairing and we define a rank function for persistence pairs and demonstrate different applications.