%0 Conference Proceedings
%T Propagation, Diffusion and Randomization in Cellular Automata
%+ Institut de Mathématiques de Marseille (I2M)
%A Theyssier, Guillaume
%Z Part 1: Invited Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Zurich, Switzerland
%Y Matthew Cook
%Y Turlough Neary
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9664
%P 3-9
%8 2016-06-15
%D 2016
%R 10.1007/978-3-319-39300-1_1
%Z Computer Science [cs]Conference papers
%X A large part of the study of cellular automata dynamics consists in comparing pairs of configurations and their orbits. Here we focus on pairs of configurations having a finite number of differences (diamonds) like in the celebrated Garden-of-Eden theorem. First, we show that it allows to study expansive-like phenomena where classical notions of chaotic behavior like positive expansivity or strong transitivity don’t apply (in reversible CAs for instance). Second, we establish that for a large class of linear CA, diffusion of diamonds is equivalent to randomization (a large class of probability measures converge weakly towards the uniform measure under the action of the CA). Both properties are also equivalent to the absence of gliders in the CA. Finally, we give examples of reversible linear CAs that are strong randomizers (the convergence towards the uniform measure is simple and not only in Cesaro mean). This strong behavior is however provably impossible with linear CA having commuting coefficients (e.g. linear CA over cyclic groups).
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01435029/document
%2 https://inria.hal.science/hal-01435029/file/395687_1_En_1_Chapter.pdf
%L hal-01435029
%U https://inria.hal.science/hal-01435029
%~ CNRS
%~ UNIV-AMU
%~ EC-MARSEILLE
%~ INSMI
%~ I2M
%~ I2M-2014-
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9664
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA