将Körner图熵推广到graphon(图极限)
Generalizing Körner's graph entropy to graphons
AI总结:
本文将Körner图熵概念推广至graphon(图极限),给出其熵的上下界,证明多数graphon的上下界重合以精确定义熵,并揭示该熵与分数色数、分数团数的关联。
摘要:
Körner于1973年提出图熵的概念,将其作为一类自然编码问题的最小码率,该问题中字母表内并非所有字母对都可被区分。后来研究发现,图熵可表示为所谓顶点装填多面体上一个最小化问题的解。\n 本文将这一概念推广到graphon(图极限)。我们证明,类似的最小化问题给出了graphon熵的一个上界,同时我们以最大化问题的形式给出了一个下界。本文的核心结果是,对于绝大多数graphon,这两个界实际上相等,因此可精确确定所讨论的熵。此外,graphon熵与分数色数、分数团数存在良好的关联。
英文摘要:
Körner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Later it turned out that it can be expressed as the solution of a minimization problem over the so-called vertex-packing polytope. In this paper we generalize this notion to graphons. We show that the analogous minimization problem provides an upper bound for graphon entropy. We also give a lower bound in the shape of a maximization problem. The main result of the paper is that for most graphons these two bounds actually coincide and hence precisely determine the entropy in question. Furthermore, graphon entropy has a nice connection to the fractional chromatic number and the fractional clique number.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。