图持久性中的稳定集和范围集
Steady and ranging sets in graph persistence
摘要:
拓扑数据分析可以提供对加权图和有向图的结构的洞察。然而,一个给定的(di)图的一些性质很难映射到单纯复形。我们介绍\textit{steady}和\textit{ranging}集:两个标准化的方法,直接从图形理论的功能产生持久性图。这两种结构都是在\textit{indexing-aware persistence functions}的上下文中构建的。此外,我们引入了一个稳定的充分条件。最后,我们将基于稳定和范围的持久性构造应用于玩具示例和现实世界的应用程序。
英文摘要:
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and \textit{ranging} sets: two standardized ways of producing persistence diagrams directly from graph-theoretical features. The two constructions are framed in the context of \textit{indexing-aware persistence functions}. Furthermore, we introduce a sufficient condition for stability. Finally, we apply the steady- and ranging-based persistence constructions to toy examples and real-world applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。