Lecture Notes in Computer Science, 2002, Volume 2493/2002, 104-113, DOI: 10.1007/3-540-45830-1_10

Universality Class of Probabilistic Cellular Automata

Danuta Makowiec and Piotr Gnaciński

View Related Documents

Abstract

The Ising-like phase transition is considered in probabilistic cellular automata (CA). The nonequilibrium CA with Toom rule are compared to standard equilibrium lattice systems to verify influence of synchronous vs asynchronous updating. It was observed by Marcq et al. [Phys.Rev.E 55(1997) 2606] that the mode of updating separates systems of coupled map lattices into two distinct universality classes. The similar partition holds in case of CA. CA with Toom rule and synchronous updating represent the weak universality class of the Ising model, while Toom CA with asynchronous updating fall into the Ising universality class.

Fulltext Preview

Image of the first page of the fulltext document