We study a class of probabilistic cellular automata (PCA) which includes majority vote models, discrete time Glauber dynamics and combinations of these processes with mixing dynamics. We give sufficient condition for the ergodicity of the processes. The method is based on a graphical representation and the construction of a ``generalized dual process''.
Back to Pablo A. Ferrari Home Page