2000 character limit reached
Computing Representatives of Persistent Homology Generators with a Double Twist (2403.04100v1)
Published 6 Mar 2024 in math.AT and cs.CG
Abstract: With the growing availability of efficient tools, persistent homology is becoming a useful methodology in a variety of applications. Significant work has been devoted to implementing tools for persistent homology diagrams; however, computing representative cycles corresponding to each point in the diagram can still be inefficient. To circumvent this problem, we extend the twist algorithm of Chen and Kerber. Our extension is based on a new technique we call saving, which supplements their existing killing technique. The resulting two-pass strategy can be realized using an existing matrix reduction implementation as a black-box and improves the efficiency of computing representatives of persistent homology generators. We prove the correctness of the new approach and experimentally show its performance.
- Ulrich Bauer. Ripser: efficient computation of vietoris–rips persistence barcodes. Journal of Applied and Computational Topology, 5(3):391–423, 2021.
- Phat: Persistent homology algorithms toolbox. Journal of Symbolic Computation, 78:76 – 90, 2017. Algorithms and Software for Computational Topology.
- The simplex tree: An efficient data structure for general simplicial complexes. Algorithmica, 70:406–427, 2014.
- Edge collapse and persistence of flag complexes. In SoCG 2020-36th International Symposium on Computational Geometry, 2020.
- Strong collapse and persistent homology. Journal of Topology and Analysis, pages 1–29, 2021.
- The compressed annotation matrix: An efficient data structure for computing persistent cohomology. In Algorithms – ESA 2013, pages 695–706, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
- Hardness results for homology localization. Discrete & Computational Geometry, 45(3):425–448, 2011.
- Persistent homology computation with a twist. In Proceedings 27th European workshop on computational geometry, volume 11, pages 197–200, 2011.
- Dualities in persistent (co)homology. Inverse Problems, 27(12):124003, nov 2011.
- Persistent cohomology and circular coordinates. In Proceedings of the twenty-fifth annual symposium on Computational geometry, pages 227–236, 2009.
- Tamal K. Dey. Computing height persistence and homology generators in R3superscript𝑅3{R}^{3}italic_R start_POSTSUPERSCRIPT 3 end_POSTSUPERSCRIPT efficiently. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’19, page 2649–2662, USA, 2019. Society for Industrial and Applied Mathematics.
- Computational topology: an introduction. American Mathematical Soc., 2010.
- Topological persistence and simplification. In Proceedings 41st annual symposium on foundations of computer science, pages 454–463. IEEE, 2000.
- On the computational complexity of betti numbers: reductions from matrix rank. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, pages 152–160. SIAM, 2014.
- Persistent homology in cosmic shear: constraining parameters with topological data analysis. Astronomy & Astrophysics, 648:A74, 2021.
- Hierarchical structures of amorphous solids characterized by persistent homology. Proceedings of the National Academy of Sciences, 113(26):7035–7040, 2016.
- Topology-preserving deep image segmentation. Advances in neural information processing systems, 32, 2019.
- Minimal cycle representatives in persistent homology using linear programming: An empirical study with user’s guide. Frontiers in artificial intelligence, 4:681117, 2021.
- The gudhi library: Simplicial complexes and persistent homology. In Mathematical Software–ICMS 2014: 4th International Congress, Seoul, South Korea, August 5-9, 2014. Proceedings 4, pages 167–174. Springer, 2014.
- Zigzag persistent homology in matrix multiplication time. In Proceedings of the twenty-seventh Annual Symposium on Computational Geometry, pages 216–225, 2011.
- Dmitriy Morozov. Persistence algorithm takes cubic time in worst case. BioGeometry News, Dept. Comput. Sci., Duke Univ, 2, 2005.
- Identification of relevant genetic alterations in cancer using topological data analysis. Nature communications, 11(1):3808, 2020.
- Toroidal coordinates: Decorrelating circular coordinates with lattice reduction. arXiv preprint arXiv:2212.07201, 2022.
- Fast computation of persistent homology representatives with involuted persistent homology. Foundations of Data Science, (early access), 2023.
- Topological detection of trojaned neural networks. Advances in Neural Information Processing Systems, 34:17258–17272, 2021.