Asymptotic randomization of subgroup shifts by linear cellular automata

Maass, Alejandro; Martínez, Servet; Pivato, Marcus and Yassawi, Reem (2006). Asymptotic randomization of subgroup shifts by linear cellular automata. Ergodic Theory Dynam. Systems, 26(4) pp. 1203–1224.

DOI: https://doi.org/10.1017/S0143385706000216

Abstract

Let M = N^D be the positive orthant of a D-dimensional lattice and let (G, +) be a finite abelian group. Let G ⊆ GM be a subgroup shift, and let µ be a Markov random field whose support is G. Let � : G−→G be a linear cellular automaton. Under broad conditions on G, we show that the Cesaro average N−1 �N−1 n=0 �n(µ) converges to a measure of maximal entropy for the shift action on G.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 67103
• Item Type
• Journal Item
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2006 Cambridge University Press
• Depositing User
• Reem Yassawi