Morse theory for filtrations and efficient computation of persistent homology (Q368767): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 7 users not shown) | |||
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 / 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 | |||
Property / reviewed by | |||
Property / reviewed by: Jonathan P. E. Hodgson / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Perseus / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Homology / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00454-013-9529-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2002165972 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59442774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology and data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On discrete Morse functions and combinatorial decompositions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stability of persistence diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4418129 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3514524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3655278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topological persistence and simplification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Morse theory for cell complexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Barcodes: The persistent topology of data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotically Fast Triangularization of Matrices over Rings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discrete Morse theoretic algorithms for computing homology of complexes and maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Optimal Morse Matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Discrete Morse theory for free chain complexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial algebraic topology / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5837859 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Toward Optimality in Discrete Morse Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zigzag persistent homology in matrix multiplication time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coreduction homology algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coreduction homology algorithm for inclusions and persistent homology / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3827224 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smith normal form of dense integer matrices fast algorithms into practice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5522742 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4227352 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Computation of Persistent Homology for Cubical Data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology for Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing persistent homology / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:30, 6 July 2024
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
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
computational topology
0 references
discrete Morse theory
0 references
persistent homology
0 references