Approximating Simplet Frequency Distribution for Simplicial Complexes
CoRR(2024)
摘要
Simplets, constituting elementary units within simplicial complexes (SCs),
serve as foundational elements for the structural analysis of SCs. Previous
efforts have focused on the exact count or approximation of simplet count
rather than their frequencies, with the latter being more practical in
large-scale SCs. This paper enables simplet frequency analysis of SCs by
introducing the Simplet Frequency Distribution (SFD) vector. In addition, we
present a bound on the sample complexity required for accurately approximating
the SFD vector by any uniform sampling-based algorithm. We also present a
simple algorithm for this purpose and justify the theoretical bounds with
experiments on some random simplicial complexes.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要