持久性的强崩溃
Strong Collapse for Persistence
摘要:
我们介绍了一种快速和内存有效的方法来计算的持续同源性(PH)的序列的单纯复形。其基本思想是通过使用强崩溃来简化输入序列的复合体,如J. Barmak和E. Miniam [DCG(2012)],并计算具有与初始PH相同PH的约化单纯复形的诱导序列的PH。我们的方法有几个显着的特点,区别于以前的工作。它不限于过滤(即嵌套单纯子复形的序列),但适用于其他类型的序列,如塔和塔标记。为了强塌缩单纯复形,我们只需要存储复形的最大单纯形,而不是它的所有单纯形的全集,这节省了大量的空间和时间。此外,该序列中的复合物可以独立地和平行地强塌缩。最后,我们可以通过选择我们强折叠的序列的单纯复形的数量来在精度和时间之间进行折衷。作为结果,并通过公开可用的数据集上的大量实验证明,我们的方法在实践中是非常快和内存效率。
英文摘要:
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 J. Barmak and E. 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 filtrations (i.e. sequences of nested simplicial subcomplexes) but works for other types of sequences like towers and zigzags. To strong collapse a simplicial complex, we only need to store the maximal simplices of the complex, not the full set of all its simplices, which saves a lot of space and time. Moreover, the complexes in the sequence can be strong collapsed independently and in parallel. Finally, we can compromize between precision and time by choosing the number of simplicial complexes of the sequence we strong collapse. As a result and as demonstrated by numerous experiments on publicly available data sets, our approach is extremely fast and memory efficient in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。