Linked Life Data

18351919

Source:http://linkedlifedata.com/resource/pubmed/id/18351919

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
1 Pt 2
pubmed:dateCreated
2008-3-20
pubmed:abstractText
We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game [Baronchelli, J. Stat. Mech.: Theory Exp. (2006) P06014] 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 with local broadcasts on random geometric graphs, 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. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. 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. We construct a finite-size scaling analysis for the agreement times in this case.
pubmed:language
eng
pubmed:journal
pubmed:status
PubMed-not-MEDLINE
pubmed:month
Jan
pubmed:issn
1539-3755
pubmed:author
pubmed:issnType
Print
pubmed:volume
77
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
016111
pubmed:year
2008
pubmed:articleTitle
Naming games in two-dimensional and small-world-connected random geometric networks.
pubmed:affiliation
Department of Physics, Applied Physics, and Astronomy, Rensselaer Polytechnic Institute,Troy, New York 12180-3590, USA. luq2@rpi.edu
pubmed:publicationType
Journal Article