English

The entropy function of an invariant measure

Logic 2019-02-20 v2 Combinatorics Probability

Abstract

Given a countable relational language LL, we consider probability measures on the space of LL-structures with underlying set N\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 nNn \in \mathbb{N} to the entropy of the measure induced by restrictions to LL-structures on {0,,n1}\{0, \ldots, n-1\}. When LL has finitely many relation symbols, all of arity k1k\ge 1, and the measure has a property called non-redundance, we show that the entropy function is of the form Cnk+o(nk)Cn^k+o(n^k), generalizing a result of Aldous and Janson. When k2k\ge 2, we show that there are invariant measures whose entropy functions grow arbitrarily fast in o(nk)o(n^k), extending a result of Hatami-Norine. For possibly infinite languages LL, we give an explicit upper bound on the entropy functions of non-redundant invariant measures in terms of the number of relation symbols in LL of each arity; this implies that finite-valued entropy functions can grow arbitrarily fast.

Keywords

Cite

@article{arxiv.1809.02290,
  title  = {The entropy function of an invariant measure},
  author = {Nathanael Ackerman and Cameron Freer and Rehana Patel},
  journal= {arXiv preprint arXiv:1809.02290},
  year   = {2019}
}

Comments

32 pages

R2 v1 2026-06-23T03:57:31.396Z