Naming Game on Adaptive Weighted Networks

Details Naming Game on Adaptive Weighted Networks Naming Game on Adaptive Weighted Networks

2011-07-16

arxiv.org/abs/1107.3263v2

Physics

Condensed Matter

Statistical Mechanics

22 pages, accepted in Artificial Life

Scientific paper

We examine a naming game on an adaptive weighted network. A weight of connection for a given pair of agents depends on their communication success rate and determines the probability with which the agents communicate. In some cases, depending on the parameters of the model, the preference toward successfully communicating agents is basically negligible and the model behaves similarly to the naming game on a complete graph. In particular, it quickly reaches a single-language state, albeit some details of the dynamics are different from the complete-graph version. In some other cases, the preference toward successfully communicating agents becomes much more relevant and the model gets trapped in a multi-language regime. In this case gradual coarsening and extinction of languages lead to the emergence of a dominant language, albeit with some other languages still being present. A comparison of distribution of languages in our model and in the human population is discussed.

Affiliated with

Also associated with

No associations

Rating

Naming Game on Adaptive Weighted 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 Game on Adaptive Weighted Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Naming Game on Adaptive Weighted Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-478544