arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.3529math.CO
收藏

无随机图子的熵及其性质

The entropy of random-free graphons and properties

Hamed Hatami, Serguei Norine

摘要:

每个图子定义了一个任意给定数量$n$顶点的随机图。已知图子是无随机的当且仅当这个随机图的熵是次二次的。我们证明,对于随机自由图子,这个熵可以增长得像任何次二次函数一样快。然而,如果图子属于无随机图性质的闭包,则熵是$O(n \log n)$。我们还给出了一个简单的非阶跃函数随机自由图子的结构,这个熵是线性的,驳斥了Janson的一个猜想。

英文摘要:

Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can grow as fast as any subquadratic function. However, if the graphon belongs to the closure of a random-free graph property, then the entropy is $O(n \log n)$. We also give a simple construction of a non-stepfunction random-free graphon for which this entropy is linear, refuting a conjecture of Janson.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑