On the algebraic numbers computable by some generalized Ehrenfest urns
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 numbe...
Main Authors: | Marie Albenque, Lucas Gerin |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2012-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/565/pdf |
Similar Items
-
Linear time recognition of P4-indifference graphs
by: Michel Habib, et al.
Published: (2001-01-01) -
q-gram analysis and urn models
by: Pierre Nicodème
Published: (2003-01-01) -
Classification of large Pólya-Eggenberger urns with regard to their asymptotics
by: Nicolas Pouyanne
Published: (2005-01-01) -
A calculus for costed computations
by: matthew hennessy
Published: (2011-03-01) -
Convergence of some leader election algorithms
by: Svante Janson, et al.
Published: (2008-01-01)