Remarks on Graphons
Abstract
L. Lov\'asz and B. Szegedy proved in 2006 that the limits of convergent graph sequences can be described by measurable symmetric functions W: [0, 1]× [0, 1] [0, 1] called graphons. In our present paper we investigate the structure of the set of all graphons within the semigroup (F([0, 1]2); ) of all fuzzy subsets of the unit square [0,1]2=[0, 1]× [0, 1], where the operation is defined by: for every f, g∈ F([0,1]2) and every s∈ [0,1]2, (f g)(s)=x∈ [0,1]2(f(x) g(s)).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.