| Stochastic Minority on Graphs (2008) | |||||||||||||
Abstract | |||||||||||||
| Cellular automata have been mainly studied on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneously). In this paper we study how the asynchronism and the topology of cells act upon the dynamics of the classical Minority rule. Beyond its apparent simplicity, this rule yields complex behaviors which are clearly linked to the structure of the graph carrying the cells. | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||