Minimal entropy approximation for cellular automata

DOI10.1088/1742-5468/2014/02/P02009MaRDI QIDQ3301871zbMATH OpenFDO

Authors Henryk Fukś

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.1240

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for construction of approximate orbits, at the heart of which is the iteration of finitely-dimensional maps, called minimal entropy maps. We present numerical evidence that minimal entropy approximation sometimes spectacularly outperforms the local structure theory in characterizing properties of cellular automata. Density response curve for elementary CA rule 26 is used to illustrate this claim.

Recommendations

• scientific article; zbMATH DE number 1223725
• Finite entropy for multidimensional cellular automata
• Apparent entropy of cellular automata
• Rescaled entropy of cellular automata
• Entropy of multidimensional cellular automata
• Densities and entropies in cellular automata
• Entropy of additive cellular automata
• scientific article; zbMATH DE number 4100614
• On computing the entropy of cellular automata.
• Minimizing Kolmogorov distance in stochastic cellular automata models

Cites work

• scientific article; zbMATH DE number 726524 (Why is no real title available?)
• Construction of local structure maps for cellular automata
• Limit sets of cellular automata associated to probability measures
• Local structure theory for cellular automata
• On solvable models in classical lattice systems
• On the measure attractor of a cellular automaton

Cited in

(4)

• Orbits of the Bernoulli measure in single-transition asynchronous cellular automata
• Construction of local structure maps for cellular automata
• Evaluating the quality of local structure approximation using elementary rule 14
• Local structure theory for cellular automata

This page was built for publication: Minimal entropy approximation for cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301871)