Abstract
Persistence modules on commutative ladders naturally arise in topological data analysis. It is known that all isomorphism classes of indecomposable modules, which are the counterparts to persistence intervals in the standard setting of persistent homology, can be derived for persistence modules on commutative ladders of finite type. Furthermore, the concept of persistence diagrams can be naturally generalized as functions defined on the Auslander-Reiten quivers of commutative ladders. A previous paper [4] presents an algorithm to compute persistence diagrams by inductively applying echelon form reductions to a given persistence module. In this work, we show that discrete Morse reduction can be generalized to this setting. Given a quiver complex \(\mathbb{X}\), we show that its persistence module \(H_q(\mathbb{X})\) is isomorphic to the persistence module \(H_q(\mathbb{A})\) of its Morse quiver complex \(\mathbb{A}\). With this preprocessing step, we reduce the computation time by computing \(H_q(\mathbb{A})\) instead, since \(\mathbb{A}\) is generally smaller in size. We also provide an algorithm to obtain such Morse quiver complexes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Assem, I., Simson, D., Skowroński, A.: Elements of the Representation Theory of Associative Algebras 1: Techniques of Representation Theory. Cambridge University Press, Cambridge (2006)
Carlsson, G., de Silva, V.: Zigzag Persistence. Found. Comput. Math. 10(4), 367–405 (2010)
Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological Persistence and Simplification. Discrete Comput. Geom. 28(4), 511–533 (2002)
Escolar, E., Hiraoka, Y.: Persistence Modules on Commutative Ladders of Finite Type, http://arxiv.org/abs/1404.7588v1
Escolar, E., Hiraoka, Y.: Morse Reduction for Zigzag Complexes. J. Indones. Math. Soc. 20(1), 47–75 (2014)
Forman, R.: Morse Theory for Cell Complexes. Adv. Math. 134, 90–145 (1998)
Mischaikow, K., Nanda, V.: Morse Theory for Filtrations and Efficient Computation of Persistent Homology. Discrete Comput. Geom. 50(2), 330–353 (2013)
Mrozek, M., Batko, B.: Coreduction Homology Algorithm. Discrete Comput. Geom. 41(1), 96–118 (2009)
Tucker, A.W.: Cell Spaces. Ann. of Math. (2) 37(1), 92–100 (1936)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escolar, E.G., Hiraoka, Y. (2014). Computing Persistence Modules on Commutative Ladders of Finite Type. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)