2012 | OriginalPaper | Buchkapitel
Density Classification on Infinite Lattices and Trees
verfasst von : Ana Bušić, Nazim Fatès, Jean Mairesse, Irène Marcovici
Erschienen in: LATIN 2012: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter
p
. We want to find a (probabilistic or deterministic) cellular automaton or a finite-range interacting particle system that decides if
p
is smaller or larger than 1/2. Precisely, the trajectories should converge to the uniform configuration with only 0’s if
p
< 1/2, and only 1’s if
p
> 1/2. We present solutions to that problem on ℤ
d
, for any
d
≥ 2, and on the regular infinite trees. For ℤ, we propose some candidates that we back up with numerical simulations.