Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Muñoz, Francisco J., Nuño, Juan Carlos
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917501878665216
author Muñoz, Francisco J.
Nuño, Juan Carlos
author_facet Muñoz, Francisco J.
Nuño, Juan Carlos
contents We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the neighborhood states, the central site takes either the majority state or the opposite and (ii) if the neighborhood states are tied, the central site either changes its current state or keeps it. The PCA is defined by two Bernoulli random variables with parameters $p,r \in [0,1]$, and we analytically solve small size cases by using a Markov process formulation. We derive analytical expressions for the probability of asymptotically reaching each possible global configuration as a function of $p$ and $r$, for all initial states. We show that for $0 < p,r < 1$, the asymptotic probability distributions of achieving any of the states for the PCA are independent of the initial conditions. This contrasts with the behavior of the deterministic Wolfram's rules 23 ($p=0,r=0$), 77 ($p=1,r=0$), 178 ($p=0,r=1$) and 232 ($p=1,r=1$), for which additional asymptotic states can occur, in particular periodic configurations Finally, we discuss applying this kind of PCA to describe opinion dynamics involving hesitant agents.
format Preprint
id arxiv_https___arxiv_org_abs_2603_27799
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232
Muñoz, Francisco J.
Nuño, Juan Carlos
Cellular Automata and Lattice Gases
Dynamical Systems
37B15, 60J10
G.2.0
We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the neighborhood states, the central site takes either the majority state or the opposite and (ii) if the neighborhood states are tied, the central site either changes its current state or keeps it. The PCA is defined by two Bernoulli random variables with parameters $p,r \in [0,1]$, and we analytically solve small size cases by using a Markov process formulation. We derive analytical expressions for the probability of asymptotically reaching each possible global configuration as a function of $p$ and $r$, for all initial states. We show that for $0 < p,r < 1$, the asymptotic probability distributions of achieving any of the states for the PCA are independent of the initial conditions. This contrasts with the behavior of the deterministic Wolfram's rules 23 ($p=0,r=0$), 77 ($p=1,r=0$), 178 ($p=0,r=1$) and 232 ($p=1,r=1$), for which additional asymptotic states can occur, in particular periodic configurations Finally, we discuss applying this kind of PCA to describe opinion dynamics involving hesitant agents.
title Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232
topic Cellular Automata and Lattice Gases
Dynamical Systems
37B15, 60J10
G.2.0
url https://arxiv.org/abs/2603.27799