关于图子的注记
Remarks on Graphons
摘要:
L. Lovász和B. Szegedy在2006年证明了收敛图序列的极限可以用称为graphons的可测对称函数$W: [0, 1]\times [0, 1]\to [0, 1]$来描述。本文研究单位正方形$[0,1]^2=[0, 1]\times [0, 1]$的所有模糊子集的半群$(\mathfrak{F}([0, 1]^2); \circ)$内的所有图子的集合的结构,其中运算$\circ$定义为:对于每个$f, g\in \mathfrak{F}([0,1]^2)$和每个$s\in [0,1]^2$,$(f\circ g)(s)=\vee_{x\in [0,1]^2}(f(x)\wedge g(s))$ .
英文摘要:
L. Lovász and B. Szegedy proved in 2006 that the limits of convergent graph sequences can be described by measurable symmetric functions $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 $(\mathfrak{F}([0, 1]^2); \circ)$ of all fuzzy subsets of the unit square $[0,1]^2=[0, 1]\times [0, 1]$, where the operation $\circ$ is defined by: for every $f, g\in \mathfrak{F}([0,1]^2)$ and every $s\in [0,1]^2$, $(f\circ g)(s)=\vee_{x\in [0,1]^2}(f(x)\wedge g(s))$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。