Density classification on infinite lattices and trees

Details Density classification on infinite lattices and trees Density classification on infinite lattices and trees

2011-11-19

arxiv.org/abs/1111.4582v1

Mathematics

Probability

Scientific paper

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular automaton or a finite-range interacting particle system that evolves on this graph and decides whether 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 the d-dimensional lattice, for any d>1, and on the regular infinite trees. For Z, we propose some candidates that we back up with numerical simulations.

Affiliated with

Also associated with

No associations

Rating

Density classification on infinite lattices and trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Density classification on infinite lattices and trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Density classification on infinite lattices and trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129731