Strong Collapse for Persistence

We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by J. Barmak and E. Miniam [DCG (2012)], and to compute the PH of an induced sequence of reduced simplicial complexes that has the same PH as the initial one. Our approach has several salient features that distinguishes it from previous work. It is not limited to filtrations (i.e. sequences of nested simplicial subcomplexes) but works for other types of sequences like towers and zigzags. To strong collapse a simplicial complex, we only need to store the maximal simplices of the complex, not the full set of all its simplices, which saves a lot of space and time. Moreover, the complexes in the sequence can be strong collapsed independently and in parallel. Finally, we can compromize between precision and time by choosing the number of simplicial complexes of the sequence we strong collapse. As a result and as demonstrated by numerous experiments on publicly available data sets, our approach is extremely fast and memory efficient in practice.

[1]  Steve Oudot,et al.  Towards persistence-based reconstruction in euclidean spaces , 2007, SCG '08.

[2]  Ghita Kouadri Mostéfaoui,et al.  A Roadmap , 2020 .

[3]  Jose A. Perea,et al.  A Klein-Bottle-Based Dictionary for Texture Representation , 2014, International Journal of Computer Vision.

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

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

[6]  André Lieutier,et al.  Efficient Data Structure for Representing and Simplifying Simplicial complexes in High Dimensions , 2012, Int. J. Comput. Geom. Appl..

[7]  G. Carlsson,et al.  Topology of viral evolution , 2013, Proceedings of the National Academy of Sciences.

[8]  J. Whitehead.  Simplicial Spaces, Nuclei and m‐Groups , 1939 .

[9]  Primoz Skraba,et al.  Zigzag persistent homology in matrix multiplication time , 2011, SoCG '11.

[10]  Konstantin Mischaikow,et al.  Morse Theory for Filtrations and Efficient Computation of Persistent Homology , 2013, Discret. Comput. Geom..

[11]  Brittany Terese Fasy,et al.  Introduction to the R package TDA , 2014, ArXiv.

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

[13]  Jean-Daniel Boissonnat,et al.  An Efficient Representation for Filtrations of Simplicial Complexes , 2016, SODA.

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

[15]  P. Dlotko,et al.  SIMPLIFICATION OF COMPLEXES FOR PERSISTENT HOMOLOGY COMPUTATIONS , 2013, 1304.8074.

[16]  Steve Oudot,et al.  Zigzag Persistence via Reflections and Transpositions , 2015, SODA.

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

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

[19]  Michael Kerber,et al.  Approximate Čech Complex in Low and High Dimensions , 2013, ISAAC.

[20]  Dmitriy Morozov,et al.  Zigzag persistent homology and real-valued functions , 2009, SCG '09.

[21]  Ulrich Bauer,et al.  PHAT - Persistent Homology Algorithms Toolbox , 2014, ICMS.

[22]  Tamal K. Dey,et al.  SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse , 2016, ESA.

[23]  Hamid Krim,et al.  Computing persistent features in big data: A distributed dimension reduction approach , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[24]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[25]  Mason A. Porter,et al.  A roadmap for the computation of persistent homology , 2015, EPJ Data Science.

[26]  Martin Tancer.  Recognition of Collapsible Complexes is NP-Complete , 2016, Discret. Comput. Geom..

[27]  Elias Gabriel Minian,et al.  Strong Homotopy Types, Nerves and Collapses , 2009, Discret. Comput. Geom..

[28]  C. H. Dowker.  HOMOLOGY GROUPS OF RELATIONS , 1952 .

[29]  Vin de Silva,et al.  Coverage in sensor networks via persistent homology , 2007 .

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

[31]  Magnus Bakke Botnan,et al.  Approximating persistent homology in Euclidean space through collapses , 2014, Applicable Algebra in Engineering, Communication and Computing.

[32]  Afra Zomorodian,et al.  The tidy set: a minimal simplicial set for computing homology of clique complexes , 2010, SCG.

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

[34]  Jean-Daniel Boissonnat,et al.  Building Efficient and Compact Data Structures for Simplicial Complexes , 2016, Algorithmica.

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

[36]  Ananthram Swami,et al.  Simplifying the homology of networks via strong collapses , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[37]  Michael Kerber,et al.  Barcodes of Towers and a Streaming Algorithm for Persistent Homology , 2019, Discret. Comput. Geom..

[38]  Don Sheehy,et al.  Linear-Size Approximations to the Vietoris–Rips Filtration , 2012, Discrete & Computational Geometry.

[39]  Gunnar E. Carlsson,et al.  Zigzag Persistence , 2008, Found. Comput. Math..

[40]  Juraj Stacho,et al.  Complexity of simplicial homology and independence complexes of chordal graphs , 2016, Comput. Geom..

[41]  Herbert Edelsbrunner,et al.  Topology preserving edge contraction , 1998 .