Opinion dynamics in social networks: A local interaction game with stubborn agents

The process by which new ideas, innovations, and behaviors spread through a large social network can be thought of as a networked interaction game: Each agent obtains information from certain number of agents in his friendship neighborhood, and adapts his idea or behavior to increase his benefit. In this paper, we are interested in how opinions, about a certain topic, form in social networks. We model opinions as continuous scalars ranging from 0 to 1 with 1(0) representing extremely positive(negative) opinion. Each agent has an initial opinion and incurs some cost depending on the opinions of his neighbors, his initial opinion, and his stubbornness about his initial opinion. Agents iteratively update their opinions based on their own initial opinions and observing the opinions of their neighbors. The iterative update of an agent can be viewed as a myopic cost-minimization response (i.e., the so-called best response) to the others' actions. We study whether an equilibrium can emerge as a result of such local interactions and how such equilibrium possibly depends on the network structure, initial opinions of the agents, and the location of stubborn agents and the extent of their stubbornness. We also study the convergence speed to such equilibrium and characterize the convergence time as a function of aforementioned factors. We also discuss the implications of such results in a few well-known graphs including small-world graphs.

[1]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[3]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[4]  L. Massoulié,et al.  Epidemics and Rumours in Complex Networks: From microscopic to macroscopic dynamics , 2009 .

[5]  Sanjeev Goyal,et al.  Learning from Neighbors , 1995 .

[6]  M. Pinsker,et al.  On the complexity of a concentrator , 1973 .

[7]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[8]  Glenn Ellison.  Learning, Local Interaction, and Coordination , 1993 .

[9]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[10]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[11]  M. Degroot.  Reaching a Consensus , 1974 .

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  Asuman E. Ozdaglar,et al.  Spread of (Mis)Information in Social Networks , 2009, Games Econ. Behav..

[14]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[15]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[18]  Drew Fudenberg,et al.  Word-of-mouth learning , 2004, Games Econ. Behav..

[19]  Andrea Montanari,et al.  Convergence to Equilibrium in Local Interaction Games , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[20]  Peter Nijkamp,et al.  Accessibility of Cities in the Digital Economy , 2004, cond-mat/0412004.

[21]  Noga Alon,et al.  An elementary construction of constant-degree expanders , 2007, SODA '07.

[22]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[23]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[24]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[25]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[26]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[27]  Abraham D. Flaxman,et al.  Expansion and Lack Thereof in Randomly Perturbed Graphs , 2007, Internet Math..

[28]  Fan Chung Graham,et al.  The Diameter of Sparse Random Graphs , 2001, Adv. Appl. Math..

[29]  J. Kleinberg.  Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[30]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[31]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[32]  A. Ozdaglar,et al.  Discrete Opinion Dynamics with Stubborn Agents , 2011 .

[33]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[34]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007, 2007 Information Theory and Applications Workshop.

[35]  Peter Secretan.  Learning , 1965, Mental Health.

[36]  S. Bikhchandani,et al.  You have printed the following article : A Theory of Fads , Fashion , Custom , and Cultural Change as Informational Cascades , 2007 .

[37]  Vivek S. Borkar,et al.  Manufacturing consent , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[38]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[39]  Douglas Gale,et al.  Bayesian learning in social networks , 2003, Games Econ. Behav..

[40]  Glenn Ellison,et al.  Rules of Thumb for Social Learning , 1993, Journal of Political Economy.

[41]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

[42]  R. Rob,et al.  Learning, Mutation, and Long Run Equilibria in Games , 1993 .

[43]  Radha Poovendran,et al.  A submodular optimization framework for leader selection in linear multi-agent systems , 2011, IEEE Conference on Decision and Control and European Control Conference.

[44]  Devavrat Shah,et al.  Gossip Algorithms , 2009, Found. Trends Netw..