Lempel-Ziv complexity analysis of one dimensional cellular automata
E. Estevez-Rams, R. Lora Serrano, C. A. J. Nunes, B., Aragon-Fernandez

TL;DR
This paper uses Lempel-Ziv complexity and information distance to analyze the information transfer and initial condition sensitivity in one-dimensional cellular automata, linking complexity reduction to physical energy dissipation.
Contribution
It introduces a novel temporal analysis method combining Lempel-Ziv complexity with entropy density to study CA dynamics and rule classification.
Findings
Complexity reduction correlates with energy dissipation.
The approach helps identify CA rules suitable for physical process simulation.
The methods are extendable to other one-dimensional dynamical systems.
Abstract
Cellular automata (CA) have long attracted attention as dynamical systems with local updating rules and yet can exhibit, for certain rules, complex, long space and time correlated patterns. This contrast with other rules which results in trivial patterns being homogeneous or periodic. In this article we approach CA from two related angles: we analyze the information transfer in the time evolution of CA driven sequences and; we revisit the sensibility of the initial configuration on sequence evolution. In order to do so, we borrow a recently reported information distance based on Kolmogorov algorithmic complexity. The normalized information distance has been used previously to find a hierarchical clustering of CA rules. What is different in our approach, is the temporal analysis of the sequence evolutions by correlating different calculated distances with entropy density. Entropy rate,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
