arXiv Analytics

Sign in

arXiv:1907.13495 [math.AT]AbstractReferencesReviewsResources

Hierarchies and Ranks for Persistence Pairs

Bastian Rieck, Filip Sadlo, Heike Leitte

Published 2019-07-31Version 1

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.

Related articles: Most relevant | Search more
arXiv:2006.16824 [math.AT] (Published 2020-06-30)
Wasserstein Stability for Persistence Diagrams
arXiv:1610.10085 [math.AT] (Published 2016-10-31)
Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
arXiv:1706.10082 [math.AT] (Published 2017-06-30)
Persistence Diagrams with Linear Machine Learning Models