不变测度的熵函数
The entropy function of an invariant measure
摘要:
给定一个可数关系语言$L$,我们考虑了在逻辑作用下不变量的具有底层集合$\mathbb{N}$的$L$ -结构空间上的概率测度。我们研究的增长率的熵函数这样的措施,定义为发送$n \in \mathbb{N}$的功能,以熵的措施引起的限制$L$ -结构上$\{0, \ldots, n-1\}$。当$L$有2个以上的关系符号,且都是元$k\ge 1$,且测度具有非冗余性时,我们证明了熵函数的形式为$Cn^k+o(n^k)$,推广了Aldous和Janson的一个结果.当$k\ge 2$时,我们证明了在$o(n^k)$中存在熵函数任意快速增长的不变测度,推广了Hatami-Norine的一个结果.对于可能无限的语言$L$,我们给出了一个明确的上限的熵函数的非冗余不变措施的关系符号的数量在$L$的每个arity,这意味着有限值熵函数可以任意快速增长。
英文摘要:
Given a countable relational language $L$, we consider probability measures on the space of $L$-structures with underlying set $\mathbb{N}$ that are invariant under the logic action. We study the growth rate of the entropy function of such a measure, defined to be the function sending $n \in \mathbb{N}$ to the entropy of the measure induced by restrictions to $L$-structures on $\{0, \ldots, n-1\}$. When $L$ has finitely many relation symbols, all of arity $k\ge 1$, and the measure has a property called non-redundance, we show that the entropy function is of the form $Cn^k+o(n^k)$, generalizing a result of Aldous and Janson. When $k\ge 2$, we show that there are invariant measures whose entropy functions grow arbitrarily fast in $o(n^k)$, extending a result of Hatami-Norine. For possibly infinite languages $L$, we give an explicit upper bound on the entropy functions of non-redundant invariant measures in terms of the number of relation symbols in $L$ of each arity; this implies that finite-valued entropy functions can grow arbitrarily fast.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。