For a general attractive Probabilistic Cellular Automata on $S^{Z^d}$, we prove that the (time-) convergence towards equilibrium of this Markovian parallel dynamics, exponentially fast in the uniform norm, is equivalent to a condition (A). This condition means the exponential decay of the influence from the boundary for the invariant measures of the system restricted to finite boxes. For a class of reversible PCA dynamics on $\{-1, +1\}^{Z^d}$ with a naturally associated Gibbsian potential $\varphi$, we prove that a (spatial-) weak mixing condition (WM) for $\varphi$ implies the validity of the assumption (A); thus exponential (time-) ergodicity of these dynamics towards the unique Gibbs measure associated to $\varphi$ holds. On some partic...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
International audienceCellular automata are a model of parallel computing. It is well known that sim...
37 pages, 10 figures; Examples and another open problem are addedCellular automata (CA) are dynamica...
We first introduce some coupling of a finite number of Probabilistic Cellular Automata dynamics (PCA...
Cotutelle de thèse franco italienne entre Univ. Lille 1 et Politecnico de Milan Directeurs de Thèse ...
In this article we study a class of shift-invariant and positive rate probabilistic cellular automat...
We study a class of probabilistic cellular automata (PCA) which includes majority vote models, disc...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
This paper considers a class of probabilistic cellular automata undergoing a phase transition with a...
International audienceProbabilistic cellular automata are considered in this review. They are CA dyn...
Cellular Automata are discrete-time dynamical systems on a spatially extended discrete space which p...
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated sync...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
International audienceCellular Automata are discrete-time dynamical systems on a spatially extended ...
A probabilistic cellular automaton (PCA) is a Markov chain on a symbolic space. Time is discrete, ce...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
International audienceCellular automata are a model of parallel computing. It is well known that sim...
37 pages, 10 figures; Examples and another open problem are addedCellular automata (CA) are dynamica...
We first introduce some coupling of a finite number of Probabilistic Cellular Automata dynamics (PCA...
Cotutelle de thèse franco italienne entre Univ. Lille 1 et Politecnico de Milan Directeurs de Thèse ...
In this article we study a class of shift-invariant and positive rate probabilistic cellular automat...
We study a class of probabilistic cellular automata (PCA) which includes majority vote models, disc...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
This paper considers a class of probabilistic cellular automata undergoing a phase transition with a...
International audienceProbabilistic cellular automata are considered in this review. They are CA dyn...
Cellular Automata are discrete-time dynamical systems on a spatially extended discrete space which p...
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated sync...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
International audienceCellular Automata are discrete-time dynamical systems on a spatially extended ...
A probabilistic cellular automaton (PCA) is a Markov chain on a symbolic space. Time is discrete, ce...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
International audienceCellular automata are a model of parallel computing. It is well known that sim...
37 pages, 10 figures; Examples and another open problem are addedCellular automata (CA) are dynamica...