<abstract xmlns="http://www.w3.org/1999/xhtml"><p>Persistence theory discussed in this paper is an application of algebraic topology (Morse Theory [29]) to Data Analysis, precisely to qualitative understanding of point cloud data, or PCD for short. PCD can be geometrized as a filtration of simplicial complexes (Vietoris-Rips complex [25] [36]) and the homology changes of these complexes provide qualitative information about the data. Bar codes describe the changes in homology with coefficients in a fixed field. When the coefficient field is ℤ<sub>2</sub>, the calculation of bar codes is done by ELZ algorithm (named after H. Edelsbrunner, D. Letscher, and A. Zomorodian [20]). When the coefficient field is ℝ, we propose an algorithm based on the Hodge decomposition [17]. With Dan Burghelea and Tamal K. Dey we developed a persistence theory which involves level sets discussed in Section 4. We introduce and discuss new computable invariants, the “relevant level persistence numbers” and the “positive and negative bar codes”, and explain how they are related to the bar codes for level persistence. We provide enhancements and modifications of ELZ algorithm to calculate such invariants and illustrate them by examples. </p></abstract>

Persistence theory discussed in this paper is an application of algebraic topology (Morse Theory [29]) to Data Analysis, precisely to qualitative understanding of point cloud data, or PCD for short. PCD can be geometrized as a filtration of simplicial complexes (Vietoris-Rips complex [25] [36]) and the homology changes of these complexes provide qualitative information about the data. Bar codes describe the changes in homology with coefficients in a fixed field. When the coefficient field is ℤ2, the calculation of bar codes is done by ELZ algorithm (named after H. Edelsbrunner, D. Letscher, and A. Zomorodian [20]). When the coefficient field is ℝ, we propose an algorithm based on the Hodge decomposition [17]. With Dan Burghelea and Tamal K. Dey we developed a persistence theory which involves level sets discussed in Section 4. We introduce and discuss new computable invariants, the “relevant level persistence numbers” and the “positive and negative bar codes”, and explain how they are related to the bar codes for level persistence. We provide enhancements and modifications of ELZ algorithm to calculate such invariants and illustrate them by examples.

Contributions to Persistence Theory

Department of Mathematics The Ohio State University 231 W 18th Ave Columbus, OH 43210 USA

Annals of West University of Timisoara - Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Contributions to Persistence Theory"}

Persistence theory discussed in this paper is an application of algebraic topology (Morse Theory [29]) to Data Analysis, precisely to qualitative understanding...

Contributions to Persistence Theory

Data publikacji: 25 mar 2015

Zakres stron: 13 - 95

Otrzymano: 28 mar 2014

Przyjęty: 15 wrz 2014

DOI: https://doi.org/10.2478/awutm-2014-0012

© Annals of West University of Timisoara - Mathematics

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.