关于概率律对随机性小破坏的稳定性
On Stability Property of Probability Laws with Respect to Small Violations of Algorithmic Randomness
摘要:
我们研究了概率定律的稳定性,就小违反算法的随机性。根据Schnorr检验算法的随机性,给出了稳定性的一个充分条件。大多数概率定律,如强大数定律,重对数定律,甚至Birkhoff的遍历变换的逐点遍历定理,在这个意义上是稳定的。然而,在遍历理论中出现了不稳定现象。首先,Birkhoff遍历定理的稳定性是不一致的。此外,可以构造一个可计算的非遍历保测度变换,使得遍历定理是不稳定的。我们还表明,任何通用的数据压缩计划也是不稳定的类的所有可计算遍历措施。
英文摘要:
We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like the strong law of large numbers, the law of iterated logarithm, and even Birkhoff's pointwise ergodic theorem for ergodic transformations, are stable in this sense. Nevertheless, the phenomenon of instability occurs in ergodic theory. Firstly, the stability property of the Birkhoff's ergodic theorem is non-uniform. Moreover, a computable non-ergodic measure preserving transformation can be constructed such that ergodic theorem is non-stable. We also show that any universal data compression scheme is also non-stable with respect to the class of all computable ergodic measures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。