论文标题
图形限制：S图的替代方法
Graph limits: An alternative approach to s-graphons
论文作者
论文摘要
我们表明，图序列的s连接等同于某些紧凑型集合（称为形状）的收敛性。该结果类似于由于Doležal，Grebík，Hladký，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.
