Naming Games in Spatially-Embedded Random Networks

Computer Science – Multiagent Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

We have found a programming error in our code used to generate the results of the earlier version. We have corrected the error

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Naming Games in Spatially-Embedded Random Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Naming Games in Spatially-Embedded Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Naming Games in Spatially-Embedded Random Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-236956

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.