Basic Ideas to Approach Metastability in Probabilistic Cellular Automata

E.M.N. Cirillo, F.R. Nardi, C. Spitoni

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

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.
Original languageEnglish
Title of host publicationProbabilistic Cellular Automata, Theory, Applications and Future Perspectives
PublisherSpringer
Pages37-51
ISBN (Electronic)978-3-319-65558-1
ISBN (Print)978-3-319-65556-7
DOIs
Publication statusPublished - 28 Feb 2018

Publication series

NameEmergence, Complexity and Computation
Volume27

Keywords

  • Reversible PCA
  • Metastability
  • Potential theoretic approach

Fingerprint

Dive into the research topics of 'Basic Ideas to Approach Metastability in Probabilistic Cellular Automata'. Together they form a unique fingerprint.

Cite this