Naming Games in Spatially-Embedded Random Networks
<|reference_start|>Naming Games in Spatially-Embedded Random Networks: We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement.<|reference_end|>
@article{lu2006naming,
    title={Naming Games in Spatially-Embedded Random Networks},
    author={Qiming Lu, G. Korniss, and Boleslaw K. Szymanski},
    journal={Proceedings of the 2006 American Association for Artificial
  Intelligence Fall Symposium Series, Interaction and Emergent Phenomena in
  Societies of Agents (AAAI Press, Menlo Park, CA 2006) pp. 148-155},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0604075},
    primaryClass={cs.MA cond-mat.stat-mech cs.AI}
}