Discrete Morse Homology and the Perseus Software Project. At its core, the computation of homology -- persistent or otherwise -- involves performing elementary row and column operations on possibly gigantic matrix representations of boundary operators defined on cell complexes. Discrete Morse theory provides a powerful and flexible framework for drastically reducing the sizes of these matrices in almost linear time while preserving all the underlying homological information. In this talk, we outline the scope and limitations of such Morse-theoretic methods. We also provide a brief overview of the Perseus software project which implements these methods in order to efficiently compute persistent homology of various types of filtered complexes.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Adiprasito, Karim A.; Benedetti, Bruno; Lutz, Frank H.: Extremal examples of collapsible complexes and random discrete Morse theory (2017)
- Bauer, Ulrich; Kerber, Michael; Reininghaus, Jan; Wagner, Hubert: Phat -- persistent homology algorithms toolbox (2017)
- Bubenik, Peter; Dłotko, Paweł: A persistence landscapes toolbox for topological statistics (2017)
- Wang, Bao; Wei, Guo-Wei: Object-oriented persistent homology (2016)
- Bubenik, Peter: Statistical topological data analysis using persistence landscapes (2015)
- Cang, Zixuan; Mu, Lin; Wu, Kedi; Opron, Kristopher; Xia, Kelin; Wei, Guo-Wei: A topological approach for protein classification (2015)
- Benedetti, Bruno; Lutz, Frank H.: Random discrete Morse theory and a new library of triangulations (2014)
- Mischaikow, Konstantin; Nanda, Vidit: Morse theory for filtrations and efficient computation of persistent homology (2013)