论文标题
某些概率的蜂窝自动机的遗传性，带有两个字母的字母，通过随机步行
Ergodicity of some probabilistic cellular automata with two letters alphabet via random walks
论文作者
论文摘要
概率性细胞自动机的成真是PCA理论中非常重要的问题。特别是，关于所有PCA具有两种尺寸邻域的急性性的问题，两个字母字母和正率仍然开放。在本文中，我们不会试图改善此问题，但是我们向某些PCA的奇迹性展示了一种新的证明（据作者的最佳知识），包括一些带有错误的CA。证明是基于对PCA与初始条件完全脱离岛屿边界的研究。这些边界的行为是随机步行的行为。
Ergodicity of probabilistic cellular automata is a very important issue in the PCA theory. In particular, the question about the ergodicity of all PCA with two-size neighbourhood, two letters alphabet and positive rates is still open. In this article, we do not try to improve this issue, but we show a new kind of proof (to the best knowledge of the author) about the ergodicity of some of those PCA, including also some CA with errors. The proof is based on the study of the boundaries of islands where the PCA is totally decorrelated from its initial condition. The behaviours of these boundaries are the ones of random walks.
