Relating the cut distance and the weak* topology for graphons

0494764 - ÚI 2019 US eng V - Výzkumná zpráva
Doležal, Martin - Grebík, Jan - Hladký, Jan - Rocha, Israel - Rozhoň, Václav
Relating the cut distance and the weak* topology for graphons.
Cornell University, 2018. 32 s. arXiv.org e-Print archive, arXiv:1806.07368 [math.CO]. Accepted March/2020 - Journal of Combinatorial Theory, Series B.
Grant CEP: GA ČR GJ16-07822Y; GA ČR(CZ) GA17-27844S; GA ČR GF17-33849L
Institucionální podpora: RVO:67985807 ; RVO:67985840
Klíčová slova: graphon * graph limit * cut norm * weak* convergence
Obor OECD: Pure mathematics
https://arxiv.org/abs/1806.07368

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. We prove that a sequence W1,W2,W3,… 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,… that are weakly isomorphic to W1,W2,W3,…. 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\'asz and Szegedy about compactness of graphons.
These results are more naturally phrased in the Vietoris hyperspace K(W0) over graphons with the weak* topology. We show that graphons with the cut distance topology are homeomorphic to a closed subset of K(W0), 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".
Trvalý link: http://hdl.handle.net/11104/0287839