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

图极限:一种可供选择的s-图子方法

Graph limits: An alternative approach to s-graphons

Martin Doležal

摘要:

我们证明了图序列的s-收敛等价于Borel概率测度的某些紧集(称为形)的收敛。这一结果类似于Doležal、Grebík、Hladkirk、Rocha和Rozhovv通过包络的收敛来表征图子收敛(相对于切割距离)。

英文摘要:

We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to the characterization of graphon convergence (with respect to the cut distance) by the convergence of envelopes, due to Doležal, Grebík, Hladký, Rocha, and Rozhovv.

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

↑