title: Social influencing and associated random walk models: Asymptotic consensus times on the complete graph.
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.
authors: Social and Cognitive Networks Academic Research Center, Rensselaer Polytechnic Institute, 110 8th Street, Troy, New York 12180-3590, USA.
authors: W
authors: W
authors: Zhang
authors: C
authors: C
authors: Lim
authors: S
authors: S
authors: Sreenivasan
authors: J
authors: J
authors: Xie
authors: B K
authors: BK
authors: Szymanski
authors: G
authors: G
authors: Korniss
mesh_terms: D008962:Models, Theoretical; D011336:Probability; D012919:Social Behavior