Given a countable relational language , we consider probability measures on the space of -structures with underlying set 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 L{0, \ldots, n-1}L$ has finitely many relation symbols, all of arity , and the measure has a property called non-redundance, we show that the entropy function is of the form , generalizing a result of Aldous and Janson. When , we show that there are invariant measures whose entropy functions grow arbitrarily fast in , extending a result of Hatami-Norine. For possibly infinite languages , we give an explicit upper bound on the entropy functions of non-redundant invariant measures in terms of the number of relation symbols in of each arity; this implies that finite-valued entropy functions can grow arbitrarily fast.

生成讲解博客的中文版本

生成AI智能校验的中文版本