Geometric bounds for persistence (Q6904084)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8117493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Geometric bounds for persistence |
scientific article; zbMATH DE number 8117493 |
Statements
Geometric bounds for persistence (English)
0 references
7 November 2025
0 references
Given a metric space \(X\), the Vietoris-Rips filtration of \(X\) is the nested sequence of the Vietoris-Rips complexes of \(X\). Analogously we may define the Čech filtration as the nested sequence of the Čech complexes of \(X\). In both cases, the filtration is parameterized by the scale parameter \(r\). Persistent homology is obtained by applying a homology functor to such a filtration. As opposed to the standard homology, which is a homotopy invariant, persistent homology in fact contains a considerable amount of information on the geometry of \(X\).\N\NIn this paper the authors provide connections between some of the classical concepts of metric geometry and persistent homology. They draw an analogy to the approach of relating object \(A\) to object \(B\) by studying the scale \(r\), at which the \(r\)-neighborhood of \(A\) contains \(B\). As a result, they bound the lifespan (over the scales \(r\)) of homology features in persistent homology using the Urysohn width, Kolmogorov widths, and the Alexandrov width. In the same spirit they define new geometric notions (treewidth, a variant of convexity, convexity deficiency, and hyperconvexity deficiency) and show how they also bound the lifespans of homological features in persistent homology.
0 references
Vietoris-Rips complex
0 references
Čech complex
0 references
persistent homology
0 references
Urysohn width
0 references
Kolmogorov width
0 references
Alexandrov width
0 references
0 references
0 references
0 references
0 references
0 references
0 references