Dark Encounter Computations

(and Musings on Biological Networks) (Extended Abstract)
  • René Peralta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4074)


Two models of distributed computation are described in which the agents are anonymous finite-state sensors interacting through a communication network whose dynamics (in case the agents are mobile) and/or topology they do not control or even know about. These models were recently introduced in a series of papers by Angluin et al. [3,4,2,5].


Random Graph Biological Network Pairwise Interaction Population Protocol Anonymous Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, R., Barabasi, A., Jeong, H.: Scale-free characteristics of random networks: The topology of the world wide web. Physica A: Statistical Mechanics and its Applications 281, 69–77 (2000)CrossRefGoogle Scholar
  2. 2.
    Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 63–74. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR–1280, Yale University Department of Computer Science (November 2003)Google Scholar
  4. 4.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 290–299. ACM Press, New York (2004)CrossRefGoogle Scholar
  5. 5.
    Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems (pre-proceedings), pp. 79–90 (December 2005)Google Scholar
  6. 6.
    Erdös, Rényi.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 17(5) (1960)Google Scholar
  7. 7.
    Luisi, P.L.: Autopoiesis: a review and a reappraisal. Naturwissenschaften 90, 49–59 (2003)Google Scholar
  8. 8.
    Schneidman, E., Berry, M.J., Segev, R., Bialek, W.: Weak pairwise correlations imply strongly correlated network states in a neural population. Nature (April 2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • René Peralta
    • 1
  1. 1.Information Technology LaboratoryNational Institute of Standards and Technology 

Personalised recommendations