English

Remarks on Graphons

Combinatorics 2021-03-30 v2

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]W: [0, 1]\times [0, 1]\to [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);)(\mathfrak{F}([0, 1]^2); \circ) of all fuzzy subsets of the unit square [0,1]2=[0,1]×[0,1][0,1]^2=[0, 1]\times [0, 1], where the operation \circ is defined by: for every f,gF([0,1]2)f, g\in \mathfrak{F}([0,1]^2) and every s[0,1]2s\in [0,1]^2, (fg)(s)=x[0,1]2(f(x)g(s))(f\circ g)(s)=\vee_{x\in [0,1]^2}(f(x)\wedge g(s)).

Keywords

Cite

@article{arxiv.1801.04555,
  title  = {Remarks on Graphons},
  author = {Attila Nagy},
  journal= {arXiv preprint arXiv:1801.04555},
  year   = {2021}
}

Comments

8 pages