Field choice problem in persistent homology (Q6050218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2989944804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Phat} -- persistent homology algorithms toolbox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing persistent homology with various coefficient fields in a single pass / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological algebra for persistence modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local behavior of spaces of natural images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of viral evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity of persistence modules and their diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of persistence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal homologous cycles, total unimodularity, and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth surfaces for multi-scale shape representation / 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: Three-dimensional alpha shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homological connectivity of random 2-complexes / 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: Sliding windows and persistence: an application of topological methods to signal analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistence modules with operators in Morse and Floer theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing persistent homology / rank
 
Normal rank

Latest revision as of 03:39, 3 August 2024

scientific article; zbMATH DE number 7748805
Language Label Description Also known as
English
Field choice problem in persistent homology
scientific article; zbMATH DE number 7748805

    Statements

    Field choice problem in persistent homology (English)
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    The choice of coefficients in homology is an important consideration when analysing data sets using persistent homology. Often, \(\mathbb{Z}_{2}\) coefficients are used as they have algorithmic advantages. It is not clear what effects this choice of coefficients has on the analysis of data sets. In particular, under which circumstances the persistence diagrams are independent of the choice of coefficients. In this paper, the authors pose 5 questions: 1) are there conditions such that the persistence diagrams are independent of the coefficient field? 2) if such conditions exist, can they be checked algorithmically? 3) should the persistence diagrams for a data set be dependent on the choice of coefficients, how can the diagrams be computed for multiple coefficient fields? 4) with what frequency does the diagram change as we change coefficients? 5) when the persistence diagram does change, how does it change? Questions 1 and 2 are answered completely, while Questions 4 and 5 are partially answered by the authors. They provide an algorithm to check the dependence of the persistence diagrams on the choice of coefficient field.
    0 references
    persistent homology
    0 references
    algorithm
    0 references
    algebraic topology
    0 references
    topological data analysis
    0 references

    Identifiers