Inefficiency of the block approximation in diploid Probabilistic Cellular Automata

Abstract

We study a probabilistic cellular automaton obtained as a mixture of the additive elementary rules 60 and 102. We prove that, for any finite periodic lattice and for mixing parameter $\lambda =1/2$, the system almost surely reaches the absorbing all-zero configuration in finitely many steps. In addition, Monte Carlo simulations indicate as well the presence of a zero-density stationary state in a finite interval around $\lambda =1/2$. Despite this absorbing behavior, both mean-field and block approximation schemes predict a stationary state with non-zero density. This failure, traced to the additive and mirror symmetries of the deterministic components, highlights a fundamental limitation of finite-block approximation in capturing the global dynamics of probabilistic cellular automata.

8 figures