同步的许多道路:自然时间尺度及其算法
Many Roads to Synchrony: Natural Time Scales and Their Algorithms
摘要:
我们考虑两个重要的时间尺度--马尔可夫阶和神秘阶--它们监视观察者如何同步到有限随机过程。我们将展示如何计算这些订单准确,他们是最有效地计算从ε机,一个过程的最小单线模型。令人惊讶的是,虽然马尔可夫序是随机过程理论的一个基本概念,但它不是过程的概率性质。更确切地说,它是一种拓扑性质,而且,除了ε机之外,它不能从任何有限状态模型计算。通过一个详尽的调查,我们关闭证明,无限马尔可夫和无限的神秘秩序是一个占主导地位的功能,在空间的有限记忆过程。我们画出的统计力学自旋系统中发挥的作用,这两个互补的长度尺度。
英文摘要:
We consider two important time scales---the Markov and cryptic orders---that monitor how an observer synchronizes to a finitary stochastic process. We show how to compute these orders exactly and that they are most efficiently calculated from the epsilon-machine, a process's minimal unifilar model. Surprisingly, though the Markov order is a basic concept from stochastic process theory, it is not a probabilistic property of a process. Rather, it is a topological property and, moreover, it is not computable from any finite-state model other than the epsilon-machine. Via an exhaustive survey, we close by demonstrating that infinite Markov and infinite cryptic orders are a dominant feature in the space of finite-memory processes. We draw out the roles played in statistical mechanical spin systems by these two complementary length scales.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。