arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.03514cs.CG
收藏

随机单纯复形的强塌缩

Strong Collapse of Random Simplicial Complexes

Jean-Daniel Boissonnat, Kunal Dutta, Soumik Dutta, Siddharth Pritam

摘要:

由Barmak和Minian提出的单纯复形的\emph{strong collapse}(\emph{Disc. Comp. Geom. 2012})是复形到其子复形的组合塌缩。最近,它受到了计算拓扑学研究人员的关注,由于其经验观察到的有用性,在简化和大小减少的大小的单纯复形,同时保持同伦类。考虑随机单纯复形上的强坍缩过程。对于边概率为$c/n$且$c>1$的$n$顶点上的Erdens-Rényi随机团复形$X(n,c/n)$,我们证明了在任意极大序列强坍缩后剩余的子复形,或\emph{core}必须渐近几乎必然(a.a.s.)地有$(1-γ)(1-cγ) n+o(n)$顶点,其中$γ$是函数$f(x) = \exp\left(-c(1-x)\right)$在范围$(0,1)$内的最小非负固定点。这是第一个理论结果证明强崩溃随机(或非随机)单纯复形。

英文摘要:

The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational topology researchers, owing to its empirically observed usefulness in simplification and size-reduction of the size of simplicial complexes while preserving the homotopy class. We consider the strong collapse process on random simplicial complexes. For the Erdős-Rényi random clique complex $X(n,c/n)$ on $n$ vertices with edge probability $c/n$ with $c>1$, we show that after any maximal sequence of strong collapses the remaining subcomplex, or \emph{core} must have $(1-γ)(1-cγ) n+o(n)$ vertices asymptotically almost surely (a.a.s.), where $γ$ is the least non-negative fixed point of the function $f(x) = \exp\left(-c(1-x)\right)$ in the range $(0,1)$. These are the first theoretical results proved for strong collapses on random (or non-random) simplicial complexes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑