Computing persistent homology with various coefficient fields in a single pass

This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent homological features in the diagrams for the different coefficient fields. This computation allows us to infer the prime divisors of the torsion coefficients of the integral homology groups of the topological space at any scale, hence furnishing a more informative description of topology than persistence in a single coefficient field. We provide theoretical complexity analysis as well as detailed experimental results. The code is part of the Gudhi software library, and is available at Maria (in: GUDHI User and Reference Manual, GUDHI Editorial Board, 2015).

[1]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[2]  Martin Fürer,et al.  Faster integer multiplication , 2007, STOC '07.

[3]  Matthew Kahle,et al.  Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes , 2017, Exp. Math..

[4]  R. Ho.  Algebraic Topology , 2022 .

[5]  Dmitriy Morozov,et al.  Persistent Cohomology and Circular Coordinates , 2011, Discret. Comput. Geom..

[6]  Tomasz Luczak,et al.  Integral Homology of Random Simplicial Complexes , 2016, Discret. Comput. Geom..

[7]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[8]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[9]  Matthew Kahle,et al.  Topology of random geometric complexes: a survey , 2014, J. Appl. Comput. Topol..

[10]  Tamal K. Dey,et al.  Computing Topological Persistence for Simplicial Maps , 2012, SoCG.

[11]  E. Coutsias,et al.  Topology of cyclo-octane energy landscape. , 2010, The Journal of chemical physics.

[12]  Jean-Daniel Boissonnat,et al.  The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology , 2013, Algorithmica.

[13]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[14]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[15]  Jean-Daniel Boissonnat,et al.  Computing persistent homology with various coefficient fields in a single pass , 2014, Journal of Applied and Computational Topology.

[16]  Chao Chen,et al.  Persistent Homology Computation with a Twist , 2011 .

[17]  Nathan Linial,et al.  Homological Connectivity Of Random 2-Complexes , 2006, Comb..

[18]  David Cohen-Steiner,et al.  Stability of Persistence Diagrams , 2005, Discret. Comput. Geom..

[19]  Nathan Linial,et al.  On the phase transition in random simplicial complexes , 2014, 1410.1281.

[20]  Ulrich Bauer,et al.  Clear and Compress: Computing Persistent Homology in Chunks , 2013, Topological Methods in Data Analysis and Visualization.

[21]  Vin de Silva,et al.  On the Local Behavior of Spaces of Natural Images , 2007, International Journal of Computer Vision.