Basic Ideas to Approach Metastability in Probabilistic Cellular Automata
Publication date
2018-02-28
Authors
Cirillo, E.M.N.
Nardi, F.R.
Spitoni, C.
Editors
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
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 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.
Keywords
Reversible PCA, Metastability, Potential theoretic approach, Taverne
Citation
Cirillo, E M N, Nardi, F R & Spitoni, C 2018, Basic Ideas to Approach Metastability in Probabilistic Cellular Automata. in Probabilistic Cellular Automata, Theory, Applications and Future Perspectives. Emergence, Complexity and Computation, vol. 27, Springer, pp. 37-51. https://doi.org/10.1007/978-3-319-65558-1_3