Skip to Main content Skip to Navigation
Conference papers

Two-dimensional traffic rules and the density classification problem

Abstract : 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.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01290290
Contributor : Nazim Fatès <>
Submitted on : Friday, April 1, 2016 - 10:47:23 PM
Last modification on : Wednesday, June 19, 2019 - 5:02:03 PM
Document(s) archivé(s) le : Wednesday, November 9, 2016 - 5:31:08 PM

Files

TwoDimensional-density-classif...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

1790

Files downloads

237