arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.07368math.CO
收藏

图子的割距离与弱 * 拓扑的关系

Relating the cut distance and the weak* topology for graphons

Martin Doležal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhoň

摘要:

graphons理论最终与所谓的割范数有关。在本文中,我们通过弱 * 拓扑(当考虑$L^{1}$ -函数的预对偶时)来逼近割范数拓扑。证明了图子序列$W_1,W_2,W_3,\ldots$在截距上收敛的充要条件是所有与$W_1,W_2,W_3,\ldots$弱同构的图子序列$W_1',W_2',W_3',\ldots$的弱聚点集和弱极限点集相等.我们进一步给出了一个简短的描述集理论的论点,每个序列的graphons包含一个子序列与上述属性。这特别是提供了一个替代证明定理的Lovász和Szegedy关于紧的空间的graphons。我们将这些结果与来自[数学(2)176(2012),no.1,151-219]的切割距离收敛的“多路切割”表征相关联。这些结果在具有弱 * 拓扑的图子上的Vietoris超空间$K$中更自然地表达。我们证明了具有割距拓扑的图子同胚于$K$的一个闭子集,并推导出这一事实的几个结果。从这些概念中,一个新的秩序的空间graphons出现。这个顺序允许比较两个图子的结构。我们建立这种“结构性秩序”的基本属性。

英文摘要:

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence $W_1,W_2,W_3,\ldots$ of graphons converges in the cut distance if and only if we have equality of the sets of weak* accumulation points and of weak* limit points of all sequences of graphons $W_1',W_2',W_3',\ldots$ that are weakly isomorphic to $W_1,W_2,W_3,\ldots$. We further give a short descriptive set theoretic argument that each sequence of graphons contains a subsequence with the property above. This in particular provides an alternative proof of the theorem of Lovász and Szegedy about compactness of the space of graphons. We connect these results to "multiway cut" characterization of cut distance convergence from [Ann. of Math. (2) 176 (2012), no. 1, 151-219]. These results are more naturally phrased in the Vietoris hyperspace $K$ over graphons with the weak* topology. We show that graphons with the cut distance topology are homeomorphic to a closed subset of $K$, and deduce several consequences of this fact. From these concepts a new order on the space of graphons emerges. This order allows to compare how structured two graphons are. We establish basic properties of this "structurdness order".

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

↑