A simple population protocol for fast robust approximate majority

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4731 LNCS, Issue , 2007, Pages 20-32

  Angluin, Dana ^a   Aspnes, James ^a   Eisenstat, David ^b  

^a YALE UNIVERSITY   (United States)

^b Princeton University

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; MULTI AGENT SYSTEMS; ROBUST CONTROL;

BYZANTINE BEHAVIOR; POPULATION PROTOCOL; REGISTER MACHINE;

NETWORK PROTOCOLS;

EID: 38049064587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_5     Document Type: Conference Paper

References (7)

1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing, 235-253 (2006)
2. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 61-75. Springer, Heidelberg (2006)
3. Feller, W.: An Introduction to Probability and its Applications, 3rd edn., vol. 1. John Wiley and Sons, Chichester (1958)
4. Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry 81(25), 2340-2361 (1977)
5. Gillespie, D.T.: A rigorous derivation of the chemical master equation. Physica A 188, 404-425 (1992)
6. Kurtz, T.G.: Approximation of Population Processes. Number 36 in CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia (1981)
7. Wormald, N.C.: Differential equations for random processes and random graphs. Annals of Applied Probability 5(4), 1217-1235 (1995)