Abstract
AbstractGiven a filtration function on a finite simplicial complex, stability theorem of persistent homology states that the corresponding barcode is continuous with respect to changes in the filtration function. However, due to the discrete setting of simplicial complexes, the simplices terminating matched bars cannot change continuously for arbitrary perturbations of filtration functions. In this paper we provide a sufficient condition for rigidity of a terminal simplex, i.e., a condition on $$\varepsilon >0$$
ε
>
0
implying that the terminal simplex of a homology class or a bar in persistent homology remains constant through $$\varepsilon $$
ε
-perturbations of filtration function. The condition for a homology class or a bar in dimension n depends only on the barcodes in dimensions n and $$n+1$$
n
+
1
.
Funder
Javna Agencija za Raziskovalno Dejavnost RS
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Geometry and Topology,Algebra and Number Theory,Analysis
Reference20 articles.
1. Adamaszek, M., Adams, H.: The Vietoris-Rips complexes of a circle. Pac. J. Math. 290, 1–40 (2017)
2. Adamaszek, M., Adams, H., Reddy, S.: On Vietoris-Rips complexes of ellipses. J. Topol. Anal. 11, 661–690 (2019)
3. Adams, H., Coskunuzer, B.: Geometric Approaches on Persistent Homology. arXiv:2103.06408
4. Bauer, U., Lesnick, M.: Induced matchings and the algebraic stability of persistence barcodes. J. Comput. Geom. 6(2), 162–191 (2015)
5. Bendich, P., Bubenik, P., Wagner, A.: Stabilizing the unstable output of persistent homology computations. J. Appl. Comput. Topology 4, 309–338 (2020)