Skip to main navigation Skip to search Skip to main content

Basic Ideas to Approach Metastability in Probabilistic Cellular Automata

Research output: Working paperPreprintAcademic

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 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
PublisherarXiv
Publication statusPublished - 28 Jun 2016

Bibliographical note

arXiv admin note: text overlap with arXiv:1307.8234

Keywords

  • cond-mat.stat-mech

Fingerprint

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

Cite this