Density Classification on Infinite Lattices and Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Density Classification on Infinite Lattices and Trees

Résumé

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 Z^d , for any d > 1, and on the regular infinite trees. For Z, we propose some candidates that we back up with numerical simulations.

Dates et versions

hal-00712614 , version 1 (27-06-2012)

Identifiants

Citer

Irène Marcovici, Ana Bušić, Nazim Fatès, Jean Mairesse. Density Classification on Infinite Lattices and Trees. 10th Latin American Theoretical Informatics Symposium (LATIN 2012), Apr 2012, Arequipa, Peru. pp.109-120, ⟨10.1007/978-3-642-29344-3_10⟩. ⟨hal-00712614⟩
232 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More