Social Influencing and Associated Random Walk Models: Asymptotic Consensus Times on the Complete Graph
arXiv:1103.4659 · doi:10.1063/1.3598450
Abstract
We investigate consensus formation and the asymptotic consensus times in stylized individual- or agent-based models, in which global agreement is achieved through pairwise negotiations with or without a bias. Considering a class of individual-based models on finite complete graphs, we introduce a coarse-graining approach (lumping microscopic variables into macrostates) to analyze the ordering dynamics in an associated random-walk framework. Within this framework, yielding a linear system, we derive general equations for the expected consensus time and the expected time spent in each macro-state. Further, we present the asymptotic solutions of the 2-word naming game, and separately discuss its behavior under the influence of an external field and with the introduction of committed agents.
References in corpus (14)
- Statistical physics of social dynamics
- Continuous Opinion Dynamics under Bounded Confidence: A Survey
- Sociophysics: A review of Galam models
- Voter Models on Heterogeneous Networks
- The role of inflexible minorities in the breaking of democratic opinion dynamics
- Non-equilibrium dynamics of language games on complex networks
- Analytical results for the Sznajd model of opinion formation
- The Naming Game in Social Networks: Community Formation and Consensus Engineering
- In-depth analysis of the Naming Game dynamics: the homogeneous mixing case
- Role of feedback and broadcasting in the naming game
- Naming Games in Two-Dimensional and Small-World-Connected Random Geometric Networks
- Effects of Mass Media and Cultural Drift in a Model for Social Influence
- Algebraic coarsening in voter models with intermediate states
- Microscopic activity patterns in the Naming Game