Stochastic Minority on Graphs

Damien Regnault (1) , Jean-Baptiste Rouquier (1) , Eric Thierry (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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.

Keywords: cellular automata; minority; asynchronism; graph

Domains: Discrete Mathematics [cs.DM]; Distributed, Parallel, and Cluster Computing [cs.DC]; Combinatorics [math.CO]; Probability [math.PR]; Cellular Automata and Lattice Gases [nlin.CG]

Damien Regnault, Jean-Baptiste Rouquier, Eric Thierry. Stochastic Minority on Graphs. 2008. ⟨hal-00272271v2⟩