2020
DOI: 10.1093/biomet/asaa097
|View full text |Cite
|
Sign up to set email alerts
|

Event history and topological data analysis

Abstract: Persistent homology is used to track the appearance and disappearance of features as we move through a nested sequence of topological spaces. Equating the nested sequence to a filtration and the appearance and disappearance of features to events, we show that simple event history methods can be used for the analysis of topological data. We propose a version of the well known Nelson-Aalen cumulative hazard estimator for the comparison of topological features of random fields and for testing parametric assumptio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 45 publications
0
11
0
Order By: Relevance
“…Other higher-order topological features are simply ignored. However, Garside et al (2021) used somewhat inefficient filtrations in the 2D plane that increase the radius of circles from the root node or points along the tree. Such filtrations produce persistent diagrams that spread points in a 2D plane.…”
Section: Trees In Persistent Homologymentioning
confidence: 99%
See 4 more Smart Citations
“…Other higher-order topological features are simply ignored. However, Garside et al (2021) used somewhat inefficient filtrations in the 2D plane that increase the radius of circles from the root node or points along the tree. Such filtrations produce persistent diagrams that spread points in a 2D plane.…”
Section: Trees In Persistent Homologymentioning
confidence: 99%
“…Then the persistence diagram of the graph filtration is simply ( w (1) , c ), ( w (2) , c ), …, ( w ( q −1) , c ) forming 1D scatter points along the horizontal line y = c , and making various analysis and operations, including matching, significantly simplified ( Songdechakraiwut & Chung, 2020b ). Figure 1 illustrates the graph filtration and corresponding 1D scatter points in persistence diagrams on the binary tree used in Garside et al (2021) . In this example, c = 0.31 is arbitrarily picked to be larger than the maximum edge weight 0.3034.…”
Section: Trees In Persistent Homologymentioning
confidence: 99%
See 3 more Smart Citations