Morse theory for filtrations and efficient computation of persistent homology (Q368767): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jonathan P. E. Hodgson / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 57Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6210578 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational topology
Property / zbMATH Keywords: computational topology / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete Morse theory
Property / zbMATH Keywords: discrete Morse theory / rank
 
Normal rank
Property / zbMATH Keywords
 
persistent homology
Property / zbMATH Keywords: persistent homology / rank
 
Normal rank

Revision as of 13:18, 28 June 2023

scientific article
Language Label Description Also known as
English
Morse theory for filtrations and efficient computation of persistent homology
scientific article

    Statements

    Morse theory for filtrations and efficient computation of persistent homology (English)
    0 references
    0 references
    0 references
    23 September 2013
    0 references
    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.
    0 references
    0 references
    computational topology
    0 references
    discrete Morse theory
    0 references
    persistent homology
    0 references