This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls are drawn and their colors are changed according to the number of black balls among them. When the time and the number of balls both tend to infinity the proportion of black balls converges to an algebraic number. We prove that, surprisingly enough, not every algebraic number can be ''computed'' this way.

Source : oai:HAL:hal-00589621v1

Volume: Vol. 14 no. 2

Published on: December 4, 2012

Submitted on: April 29, 2011

Keywords: population protocols,distributed computing : approximation of Markov chains,Ehrenfest,[INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

This page has been seen 257 times.

This article's PDF has been downloaded 140 times.