Analytic treatment of tipping points for social consensus in large random networks.
We introduce a homogeneous pair approximation to the naming game (NG) model by deriving a six-dimensional Open Dynamics Engine (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.
NeST Center and Mathematical Sciences Department, Rensselaer Polytechnic Institute, 110 8th Street, Troy, New York 12180-3590, USA. zhangw10@rpi.edu
W
W
Zhang
C
C
Lim
B K
BK
Szymanski
D000465:Algorithms; D003142:Communication; D003198:Computer Simulation; D006801:Humans; D015233:Models, Statistical; D016012:Poisson Distribution; D012919:Social Behavior; D012944:Social Support