Analytic Treatment of Tipping Points for Social Consensus in Large Random Networks

Abstract

We introduce a homogeneous pair approximation to the Naming Game (NG) model by deriving a six-dimensional ODE for the two-word Naming Game. Our ODE reveals the change in dynamical behavior of the Naming Game as a function of the average degree < k > of an uncorrelated network. This result is in good agreement with the numerical results. We also analyze the extended NG model that allows for presence of committed nodes and show that there is a shift of the tipping point for social consensus in sparse networks.

7 pages, 5 figures

References in corpus (9)

• Statistical physics of social dynamics
• Social consensus through the influence of committed minorities
• Sharp transition towards shared vocabularies in multi-agent systems
• Non-equilibrium dynamics of language games on complex networks
• Analytical Solution of the Voter Model on Disordered Networks
• Topology Induced Coarsening in Language Games
• Heterogeneous pair approximation for voter models on networks
• Role of feedback and broadcasting in the naming game
• Social Influencing and Associated Random Walk Models: Asymptotic Consensus Times on the Complete Graph

Cited by in corpus (8)

• Network resilience
• Threshold-limited spreading in social networks with multiple initiators
• Group interactions modulate critical mass dynamics in social convention
• Opinion Dynamics and Influencing on Random Geometric Graphs
• Propensity and stickiness in the naming game: Tipping fractions of minorities
• Analysis of the high dimensional naming game with committed minorities
• The Effects of Communication Burstiness on Consensus Formation and Tipping Points in Social Dynamics
• Effect of multiple degrees of ambivalence on the Naming Game