Morse theory for filtrations and efficient computation of persistent homology (Q368767)

Persistent homology is a growing technique in the analyis of large data sets (see \textit{G. Carlsson} [Topology and data, Bull. Am. Math. Soc., New Ser. 46, No. 2, 255--308 (2009; Zbl 1172.62002)]). The authors of this paper propose a method of reducing the complexity of computing persistent homology by reducing the number of cells in the filtered complex while preserving the homology. The technique is based on an extension of combinatorial Morse theory from complexes to filtrations. The authors describe an algorithm \textit{MorseReduce} that performs a persistent homology preserving reduction on a filtered complex. They show that indeed this reduction preserves persistent homology. The authors evaluate the complexity of the algorithm. Experimental results are given showing the effectiveness of the reduction.