Decorated merge trees for persistent topology
From MaRDI portal
Publication:2082453
DOI10.1007/s41468-022-00089-3OpenAlexW3141076273MaRDI QIDQ2082453
Haibin Hang, Washington Mio, Osman Berat Okutan, Tom Needham, Justin Michael Curry
Publication date: 4 October 2022
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.15804
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Categorified Reeb graphs
- Topological data analysis and cosheaves
- Gromov-Wasserstein distances and the metric approach to object matching
- Metrics for generalized persistence modules
- Generalized persistence diagrams
- The rank invariant stability via interleavings
- Topological persistence and simplification
- Witnessed \(k\)-distance
- Classifying clustering schemes
- Zigzag persistence
- Barcode embeddings for metric graphs
- Generalized persistence diagrams for persistence modules over posets
- Categorification of persistent homology
- Reeb posets and tree approximations
- A topological study of functional data and Fréchet functions of metric measure spaces
- The fiber of the persistence map for functions on the interval
- The persistent homotopy type distance
- Probing the geometry of data with diffusion Fréchet functions
- The theory of the interleaving distance on multidimensional persistence modules
- Sliding windows and persistence: an application of topological methods to signal analysis
- Cochains and homotopy type
- On the geometry of metric measure spaces. I
- Computing the Gromov-Hausdorff Distance for Metric Trees
- Theory of interleavings on categories with a flow
- Persistent homology transform for modeling shapes and surfaces
- Topological pattern recognition for point cloud data
- Decomposition of pointwise finite-dimensional persistence modules
- The Gromov–Wasserstein distance between networks and stable network invariants
- FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees
- Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
- Inverse Problems in Topological Persistence
- Decomposition of persistence modules
- Predicting Clinical Outcomes in Glioblastoma: An Application of Topological and Functional Data Analysis
- Comparing Graphs via Persistence Distortion
- Proximity of persistence modules and their diagrams
- Optimal Transport
This page was built for publication: Decorated merge trees for persistent topology