Fast computation of persistent homology representatives with involuted persistent homology
From MaRDI portal
Publication:6194408
DOI10.3934/fods.2023006arXiv2105.03629OpenAlexW3162517897MaRDI QIDQ6194408
Publication date: 14 February 2024
Published in: Foundations of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.03629
Persistent homology and applications, topological data analysis (55N31) Combinatorial aspects of simplicial complexes (05E45) Topological data analysis (62R40)
Cites Work
- Unnamed Item
- Unnamed Item
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Persistent cohomology and circular coordinates
- Random geometric complexes
- Topological persistence and simplification
- A combinatorial method to compute explicit homology cycles using discrete Morse theory
- Optimal homologous cycles, total unimodularity, and linear programming
- Julia: A Fresh Approach to Numerical Computing
- Dualities in persistent (co)homology
- Volume-Optimal Cycle: Tightest Representative Cycle of a Generator in Persistent Homology
- Topology of viral evolution
- Persistent 1-cycles: definition, computation, and its application
This page was built for publication: Fast computation of persistent homology representatives with involuted persistent homology