快速计算Zigzag代表的算法
A Fast Algorithm for Computing Zigzag Representatives
AI总结:
本文提出一种O(m²n)时间复杂度的算法,用于高效计算Zigzag过滤中兼容的代表循环,解决了传统方法在处理Zigzag过滤时效率低下的问题。
摘要:
Zigzag滤波器的简单复形泛化了常规滤波器,允许简单形的删除和插入。从Zigzag滤波器计算出的条形码编码了同调特征的演变。尽管现有算法可以定位特定特征于滤波器中的任意索引,但得到的代表可能不兼容Zigzag:一个索引处的代表循环可能无法映射到其邻居。为此,需要在每个条形码的条上计算兼容的代表循环。已知Zigzag滤波器的条形码可在O(m^ω)时间内计算,其中ω<2.373是矩阵乘法指数。然而,如何高效计算兼容的代表尚不清楚。对于非Zigzag滤波器,经典矩阵算法提供O(m³)时间的代表,可改进到O(m^ω)。然而,已知的Zigzag滤波器算法无法在O(m³)时间内计算代表。本文提出一种O(m²n)时间的算法解决此问题,其中n≤m是过滤器中最大复形的大小。
英文摘要:
Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with $m$ insertions and deletions can be computed in $O(m^ω)$ time, where $ω< 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^2n)$ time algorithm for this problem, where $n\leq m$ is the size of the largest complex in the filtration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。