Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computing with large populations using interactions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
We recently obtained partial results on the computational power of population protocols when the population is assumed to be large. We studied in particular a particular protocol that we proved to converge towards 12, using weak-convergence methods for stochastic processes. In this paper, we prove that it is possible to compute 12 with precision @e0 in a time polynomial in 1@e using a number of agents polynomial in 1@e, with individuals that can have only two states. This is established through a general result on approximation of stochastic differential equations by a stochastic Euler-like discretization algorithm, of general interest.