Can I read Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules on EtoBox?

Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules by Dey, Tamal K.; Xin, Cheng is a scholarly article available to read on EtoBox.

What is Generalized Persistence Algorithm for Decomposing Multi-parameter Persistence Modules about?

The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological data analysis. Its input is a simplicial filtration defined over the integers $\mathbb{Z}$ giving rise to a $1$-parameter persistence module. It has been recognized that multiparameter version of persistence modules given by simplicial filtrations over $d$-dimensional integer grids $\mathbb{Z}^d$ is equally or perhaps more important in data science applications. However, in the multiparameter setting, one of the main challenges is that topological summaries based on algebraic structure such as decompositions and bottleneck distances cannot be as efficiently computed as in the $1$-parameter case because there is no known extension of the persistence algorithm to multiparameter persistence modules. We present an efficient algorithm to compute the unique decomposition of a finitely presented persistence module $M$ defined over the multiparameter $\mathbb{Z}^d$. The algorithm first assumes that the module is presented with a set of $N$ generators an

Author

Dey, Tamal K.; Xin, Cheng

Published

2019

Language

EN