Hierarchies and Ranks for Persistence Pairs

DOI10.1007/978-3-030-43036-8_1zbMath1479.55013arXiv1907.13495OpenAlexW2965311640MaRDI QIDQ5147725

F. Sadlo, Heike Leitte, Bastian Rieck

Publication date: 28 January 2021

Published in: Mathematics and Visualization (Search for Journal in Brave)

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

zbMATH Keywords

topological data analysispersistent homologypersistence pairspersistence diagrams

Mathematics Subject Classification ID

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

Related Items (1)

Mergemaps: Treemaps for Scientific Data

Uses Software

• Gudhi
• Topology ToolKit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Stability of persistence diagrams
• Efficient algorithms for computing Reeb graphs
• Localized homology
• Lipschitz functions have \(L_{p}\)-stable persistence
• The theory of multidimensional persistence
• Computing contour trees in all dimensions
• Homology and robustness of level and interlevel sets
• Stabilizing the unstable output of persistent homology computations
• The Gudhi Library: Simplicial Complexes and Persistent Homology
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Measuring the Distance Between Merge Trees
• The TOPORRERY: computation and presentation of multi-resolution topology
• Morse Theory. (AM-51)
• Measuring Distance between Reeb Graphs
• Zigzag persistent homology and real-valued functions
• Persistence-Based Clustering in Riemannian Manifolds

This page was built for publication: Hierarchies and Ranks for Persistence Pairs