View in EDS HTML Full Text PDF Full Text

Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets.

Saved in:
Bibliographic Details
Title: Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets.
Authors: Alonso, Ángel Javier1 (AUTHOR) alonsohernandez@tugraz.at, Kerber, Michael1 (AUTHOR) kerber@tugraz.at
Source: Discrete & Computational Geometry. Dec2025, Vol. 74 Issue 4, p818-838. 21p.
Subjects: Mathematical decomposition, Metric spaces, Clustering algorithms, Zero (The number)
Abstract: We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets. In the case of a filtered metric space M, rooted subsets relate the clustering behavior of the points of M with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules. [ABSTRACT FROM AUTHOR]
Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 189681736
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Alonso%2C+Ángel+Javier%22">Alonso, Ángel Javier</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> alonsohernandez@tugraz.at</i><br /><searchLink fieldCode="AR" term="%22Kerber%2C+Michael%22">Kerber, Michael</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> kerber@tugraz.at</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+%26+Computational+Geometry%22">Discrete & Computational Geometry</searchLink>. Dec2025, Vol. 74 Issue 4, p818-838. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+decomposition%22">Mathematical decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22Metric+spaces%22">Metric spaces</searchLink><br /><searchLink fieldCode="DE" term="%22Clustering+algorithms%22">Clustering algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Zero+%28The+number%29%22">Zero (The number)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets. In the case of a filtered metric space M, rooted subsets relate the clustering behavior of the points of M with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189681736
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00454-024-00700-7
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 818
    Subjects:
      – SubjectFull: Mathematical decomposition
        Type: general
      – SubjectFull: Metric spaces
        Type: general
      – SubjectFull: Clustering algorithms
        Type: general
      – SubjectFull: Zero (The number)
        Type: general
    Titles:
      – TitleFull: Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Alonso, Ángel Javier
      – PersonEntity:
          Name:
            NameFull: Kerber, Michael
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 01795376
          Numbering:
            – Type: volume
              Value: 74
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Discrete & Computational Geometry
              Type: main
ResultId 1