Combinatorics Seminar

The cut norm and the weak* topology for graphons

-
Speaker(s): Jan Hladky (The Czech Academy of Sciences, The Institute of Computer Science)
The cut norm, introduced by Borgs-Chayes-Lovasz-Sos-Szegedy-Vesztergombi is in the heart of the theory of limits of dense graph sequences a.k.a. graphons. With Dolezal, Grebik, Rocha a Rozhon we looked at the relation between this norm and the weak* topology. This view gives a number of insights including an alternative proof of the celebrated Lovasz-Szegedy compactness theorem for graphons.

Zoom link