arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.06542math.PRmath.DS
收藏

熵有效有限编码

Entropy-efficient finitary codings

Tom Meyerovitch, Yinon Spinka

摘要:

证明了任意有限熵的可数值有限因子也可以表示为熵任意接近目标过程的有限值有限因子。作为应用,我们肯定地回答了van den Berg和Steif关于$\mathbb{Z}^d$上的临界伊辛模型的一个问题.在此过程中,我们证明了关于有限同构和有限因子的几个结果。我们的结果是在一个新的框架下发展的过程不变的置换群满足特定的性质的可数集。这个新的框架包括可数顺从群上的所有“经典”过程和具有“唯一中心球”的传递顺从图上的所有不变过程。我们的一些结果是新的已经为$\mathbb{Z}$ -过程。证明了非独立$\mathbb{Z}$ -过程的Smorodinsky同构定理的一个相对版本.我们还扩展了Keane-Smorodinsky有限同构定理,可数值的独立同分布过程和独立同分布过程的值在波兰空间。

英文摘要:

We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application, we give an affirmative answer to a question of van den Berg and Steif about the critical Ising model on $\mathbb{Z}^d$. En route, we prove several results about finitary isomorphisms and finitary factors. Our results are developed in a new framework for processes invariant to a permutation group of a countable set satisfying specific properties. This new framework includes all ``classical'' processes over countable amenable groups and all invariant processes on transitive amenable graphs with ``uniquely centered balls''. Some of our results are new already for $\mathbb{Z}$-processes. We prove a relative version of Smorodinsky's isomorphism theorem for finitely dependent $\mathbb{Z}$-processes. We also extend the Keane--Smorodinsky finitary isomorphism theorem to countable-valued i.i.d processes and to i.i.d processes taking values in a Polish space.

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

↑