Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete time Markov chains on lattice with finite single--cell states whose distinguishing feature is the \textit{parallel} character of the updating rule. We review the some of the results obtained about the metastable behavior of Probabilistic Cellular Automata and we try to point out difficulties and peculiarities with respect to standard Statistical Mechanics Lattice models.

### Basic Ideas to Approach Metastability in Probabilistic Cellular Automata

#### Abstract

Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete time Markov chains on lattice with finite single--cell states whose distinguishing feature is the \textit{parallel} character of the updating rule. We review the some of the results obtained about the metastable behavior of Probabilistic Cellular Automata and we try to point out difficulties and peculiarities with respect to standard Statistical Mechanics Lattice models.
##### Scheda breve Scheda completa
978-3-319-65556-7
978-3-319-65558-1
File allegati a questo prodotto
File
cns-pca_rev.pdf

solo gestori archivio

Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1113311