Two-dimensional traffic rules and the density classification problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Two-dimensional traffic rules and the density classification problem

Nazim Fatès
Irène Marcovici
Siamak Taati
  • Function : Author
  • PersonId : 978944


The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem. On the other hand, it was shown that a probabilistic mixture of the traffic rule and the majority rule solves the one-dimensional problem correctly with a probability arbitrarily close to one. We investigate the possibility of a similar approach in two dimensions. We show that in two dimensions, the particle spacing problem, which is solved in one dimension by the traffic rule, has no cellular automaton solution. However, we propose exact and randomized solutions via interacting particle systems. We assess the performance of our models using numeric simulations.
Fichier principal
Vignette du fichier
TwoDimensional-density-classif.pdf (362.62 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01290290 , version 1 (01-04-2016)




Nazim Fatès, Irène Marcovici, Siamak Taati. Two-dimensional traffic rules and the density classification problem. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zürich, France. pp.135-148, ⟨10.1007/978-3-319-39300-1_11⟩. ⟨hal-01290290⟩
1290 View
106 Download



Gmail Mastodon Facebook X LinkedIn More