一个不承认成功的基本i.i.d.的概率元胞自动机。耦合
A probabilistic cellular automaton that admits no successful basic i.i.d. coupling
摘要:
在本文中,我们回顾了{0,1} Z上的概率元胞自动机(PCA)的一个经典例子,即,左相邻单元和右相邻单元的状态的模2加法,随后以概率p保留加法的结果,或者以概率1 -p翻转加法的结果。众所周知,对于p的任何值$\in$ ]0,1[,这个PCA是遍历的我们表明,对于p足够接近1,没有耦合的PCA动力学的组成的i.i.d.最近邻状态的随机函数(我们称之为基本i.i.d.)耦合)可以是成功的,其中成功意味着,对于任何给定的单元,当t变为无穷大时,每个可能的初始条件在t个时间步之后导致相同状态的概率变为1。特别地,这排除了基于这种耦合的CFTP方案的可能性。这个属性与单调PCA的情况形成鲜明对比,对于单调PCA,只要遍历性成立,就存在一个成功的基本独立同分布。偶合器.
英文摘要:
In this paper, we revisit a classic example of probabilistic cellular automaton (PCA) on {0, 1} Z , namely, addition modulo 2 of the states of the left-and right-neighbouring cells, followed by either preserving the result of the addition, with probability p, or flipping it, with probability 1 -- p. It is well-known that, for any value of p $\in$]0, 1[, this PCA is ergodic. We show that, for p sufficiently close to 1, no coupling of the PCA dynamics based on the composition of i.i.d. random functions of nearest-neighbour states (we call this a basic i.i.d. coupling), can be successful, where successful means that, for any given cell, the probability that every possible initial condition leads to the same state after t time steps, goes to 1 as t goes to infinity. In particular, this precludes the possibility of a CFTP scheme being based on such a coupling. This property stands in sharp contrast with the case of monotone PCA, for which, as soon as ergodicity holds, there exists a successful basic i.i.d. coupling.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。