2021 **Abstract:** In this paper, we introduce a fast and memory efficient approach to compute the Persistent Homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by Barmak and Miniam [DCG (2012)], and to compute the PH of an induced sequence of reduced simplicial complexes that has the same PH as the initial one. Our approach has several salient features that distinguishes it from previous work. It is not limited to filtra…

Help me understand this report

Search citation statements

Select...

1

1

1

1

0

7

0

Year Published

2021

2021

Publication Types

Select...

3

1

Relationship

0

4

Authors

Journals

0

7

0

“…We foresee that the subject of homological skeletonization is not yet concluded. Other approaches to finding canonical generators of homology are possible (for example in 56,85 ), and we plan to investigate them further in subsequent works.…”

- Search over 1.2b+ citation statments to see what is being said about any topic in the research literature
- Advanced Search to find publications that support or contrast your research
- Citation reports and visualizations to easily see what publications are saying about each other
- Browser extension to see Smart Citations wherever you read research
- Dashboards to evaluate and keep track of groups of publications
- Alerts to stay on top of citations as they happen
- Automated reference checks to make sure you are citing reliable research in your manuscripts
**7 day free preview of our premium features.**

Over 130,000 students researchers, and industry experts at use scite

See what students are saying

“…We foresee that the subject of homological skeletonization is not yet concluded. Other approaches to finding canonical generators of homology are possible (for example in 56,85 ), and we plan to investigate them further in subsequent works.…”

“…We will focus primarily on sequential approaches to persistent homology computation. Other, non-sequential approaches include the chunk algorithm [3], spectral sequence procedures [46,22], Morse-theoretic batch reduction [32,33,58,6,29,34,48,59,21], distributed algorithms [4,53,44], GPU acceleration [63,38], streaming [41], and homotopy collapse [9,20,8]. There are closely related techniques in matrix factorization and zigzag persistence [50,11,10].…”

“…Proof. By Equation (8), the matrix M ρκ is a generalized permutation matrix. Since M = R −1 DC one argues, by induction, that each non-pivot row of D (working from the bottom up) can be deleted without reducing the rank of D. A similar argument holds for columns, working left to right.…”

“…Also, the efficiency of state-of-the-art software for flag complexes, such as Ripser [Bau19] and Eirene [HHSS19] is to a large extent due to implicit compression. Another recent line of research uses the concept of strong collapses to arrive at a small complex quickly, in general [BPP18], and for flag complexes [BP20].…”