Stochastic minority on graphs

Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). In this paper, we study how the asynchronism and the graph act upon the dynamics of the classical minority rule. Minority...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2011-07, Vol.412 (30), p.3947-3963
Main Authors: Rouquier, Jean-Baptiste, Regnault, Damien, Thierry, Éric
Format: Article
Language:English
Subjects:
Asymptotic properties
Computer Science
Convergence
Dynamic tests
Dynamics
Graphs
Minorities
Synchronous
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). In this paper, we study how the asynchronism and the graph act upon the dynamics of the classical minority rule. Minority has been well-studied for synchronous updates and is thus a reasonable choice to begin with. Yet, beyond its apparent simplicity, this rule yields complex behaviors when asynchronism is introduced. We investigate the transitory part as well as the asymptotic behavior of the dynamics under full asynchronism (also called sequential: only one random vertex updates at each time step) for several types of graphs. Such a comparative study is a first step in understanding how the asynchronous dynamics is linked to the topology (the graph). Previous analyses on the grid Regnault et al. (2009, 2010) have observed that minority seems to induce fast stabilization. We investigate here this property on arbitrary graphs using tools such as energy, particles and random walks. We show that the worst case convergence time is, in fact, strongly dependent on the topology. In particular, we observe that the case of trees is nontrivial.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2011.02.028