Propensity and stickiness in the naming game: Tipping fractions of minorities

Authored by Andrew M. Thompson, Boleslaw K. Szymanski, Chjan C. Lim

Date Published: 2014-10-15

DOI: 10.1103/physreve.90.042809

Sponsors: European Union United States Office of Naval Research (ONR) United States Army

Platforms: No platforms listed

Model Documentation: Other Narrative Mathematical description

Model Code URLs: Model code not found

Abstract

Agent-based models of the binary naming game are generalized here to represent a family of models parameterized by the introduction of two continuous parameters. These parameters define varying listener-speaker interactions on the individual level with one parameter controlling the speaker and the other controlling the listener of each interaction. The major finding presented here is that the generalized naming game preserves the existence of critical thresholds for the size of committed minorities. Above such threshold, a committed minority causes a fast (in time logarithmic in size of the network) convergence to consensus, even when there are other parameters influencing the system. Below such threshold, reaching consensus requires time exponential in the size of the network. Moreover, the two introduced parameters cause bifurcations in the stabilities of the system's fixed points and may lead to changes in the system's consensus.

Tags