Afra Zomorodian
ABSTRACT
We study the homology of a filtered d-dimensional simplicial complex K as a single algebraic entity and establish a correspondence that provides a simple description over fields. Our analysis enables us to derive a natural algorithm for computing persistent homology over an arbitrary field in any dimension. Our study also implies the lack of a simple classification over non-fields. Instead, we give an algorithm for computing individual persistent homology groups over an arbitrary PIDs in any dimension.
- BASU, S. On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets. Discrete Comput. Geom. 22 (1999), 1--18.Google Scholar
Cross Ref
- CARLSSON, E., CARLSSON, G., AND DE SILVA, V. An algebraic topological method for feature identification, 2003. Manuscript.Google Scholar
- CARLSSON, G., COLLINS, A., GUIBAS, L., AND ZOMORODIAN, A. Persistence Barcodes for Shapes, 2004. Manuscript.Google Scholar
- DONALD, B. R., AND CHANG, D. R. On the complexity of computing the homology type of a triangulation. In Proc. 32nd Ann. IEEE Sympos. Found Comput. Sci. (1991), pp. 650--661. Google ScholarDigital Library
- DUMAS, J.-G., HECKENBACH, F., SAUNDERS, B. D., AND WELKER, V. Computing simplicial homology based on efficient Smith normal form algorithms. In Proc. Integration of Algebra and Geometry Software Systems (2002). To be published.Google Scholar
- DUMMIT, D., AND FOOTE, R. Abstract Algebra. John Wiley & Sons, Inc., New York, NY, 1999.Google Scholar
- EDELSBRUNNER, H., LETSCHER, D., AND ZOMORODIAN, A. Topological persistence and simplification. Discrete Comput. Geom. 28 (2002), 511--533.Google ScholarDigital Library
- EISENBUD, D. Commutative Algebra with a View Toward Algebraic Theory. Springer, New York, NY, 1995.Google Scholar
- FRIEDMAN, J. Computing Betti numbers via combinatorial Laplacians. In Proc. 28th Ann. ACM Sympos. Theory Comput. (1996), pp. 386--391. Google ScholarDigital Library
- GRANLUND, T. The GNU multiple precision arithmetic library. http://www.swox.com/gmp.Google Scholar
- GROMOV, M. Hyperbolic groups. In Essays in Group Theory, S. Gersten, Ed. Springer Verlag, New York, NY, 1987, pp. 75--263.Google Scholar
- MUNKRES, J. R. Elements of Algebraic Topology. Addison-Wesley, Reading, MA, 1984.Google Scholar
- UHLIG, F. Transform Linear Algebra. Prentice Hall, Upper Saddle River, NJ, 2002.Google Scholar
- ZOMORODIAN, A. Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes. PhD thesis, University of Illinois at Urbana-Champaign, 2001. Google ScholarDigital Library
Index Terms
- Computing persistent homology
Recommendations
Measuring and computing natural generators for homology groups
We develop a method for measuring homology classes. This involves two problems. First, we define the size of a homology class, using ideas from relative homology. Second, we define an optimal basis of a homology group to be the basis whose elements' ...
Incremental-decremental algorithm for computing AT-models and persistent homology
CAIP'11: Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part IIn this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend ...
An output-sensitive algorithm for persistent homology
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryIn this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ>0, it returns only those homology classes with persistence at least Γ. Instead of the classical reduction via ...
Comments