同调环的几何定位
Geometric Localization of Homology Cycles
AI总结:
本文针对同调定位这一NP难问题,提出一种多项式时间可计算且近似稳定的环几何优化方法,并设计近似算法高效求解最优同调环、最小同调基及最小持续同调基,实验验证了其高质量与实用性。
摘要:
在给定同调类中计算最优环,也称为同调定位问题,通常被认为是NP难问题。此外,目前尚无已知的最优性准则能够在几何上定位类,并在持续同调设定下具有稳定性。我们提出了一种环的几何优化方法,该方法可在多项式时间内计算,并在近似意义下具有稳定性。通过针对不同设定调整我们的搜索准则,我们得到了各种优化问题,如最优同调环、最小同调基和最小持续同调基。在实践中,(平凡的)精确算法尽管最坏情况运行时间为多项式,但计算代价仍然很高。因此,我们为上述问题设计了近似算法,并通过实验研究其性能。这些算法在中等规模数据集上具有合理的运行时间,并且这些算法计算出的环在多个数据集上的实验表明其质量始终很高。
英文摘要:
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes geometrically and admits a stability property under the setting of persistent homology. We present a geometric optimization of the cycles that is computable in polynomial time and is stable in an approximate sense. Tailoring our search criterion to different settings, we obtain various optimization problems like optimal homologous cycle, minimum homology basis, and minimum persistent homology basis. In practice, the (trivial) exact algorithm is computationally expensive despite having a worst case polynomial runtime. Therefore, we design approximation algorithms for the above problems and study their performance experimentally. These algorithms have reasonable runtimes for moderate sized datasets and the cycles computed by these algorithms are consistently of high quality as demonstrated via experiments on multiple datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。