Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Probabilistic Cellular AutomataBasic Ideas to Approach Metastability in Probabilistic Cellular Automata

Probabilistic Cellular Automata: Basic Ideas to Approach Metastability in Probabilistic Cellular... [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Probabilistic Cellular AutomataBasic Ideas to Approach Metastability in Probabilistic Cellular Automata

Part of the Emergence, Complexity and Computation Book Series (volume 27)
Editors: Louis, Pierre-Yves; Nardi, Francesca R.
Cirillo, Emilio N. M.; Nardi, Francesca R.; Spitoni, Cristian
Probabilistic Cellular Automata — Feb 22, 2018
Download PDF
14 pages

Loading next page...
 
/lp/springer-journals/probabilistic-cellular-automata-basic-ideas-to-approach-metastability-PXGKoGu5au
Publisher
Springer International Publishing
Copyright
© Springer International Publishing AG 2018
ISBN
978-3-319-65556-7
Pages
37 –51
DOI
10.1007/978-3-319-65558-1_3
Publisher site
See Chapter on Publisher Site

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.]

Published: Feb 22, 2018

Keywords: Reversible PCA; Metastability; Potential theoretic approach

There are no references for this article.