skip to main content
research-article

Binary Opinion Dynamics with Stubborn Agents

Published:01 December 2013Publication History
Skip Abstract Section

Abstract

We study binary opinion dynamics in a social network with stubborn agents who influence others but do not change their opinions. We focus on a generalization of the classical voter model by introducing nodes (stubborn agents) that have a fixed state. We show that the presence of stubborn agents with opposing opinions precludes convergence to consensus; instead, opinions converge in distribution with disagreement and fluctuations. In addition to the first moment of this distribution typically studied in the literature, we study the behavior of the second moment in terms of network properties and the opinions and locations of stubborn agents. We also study the problem of optimal placement of stubborn agents where the location of a fixed number of stubborn agents is chosen to have the maximum impact on the long-run expected opinions of agents.

References

  1. Daron Acemoglu and Asuman Ozdaglar. 2010. Opinion dynamics and learning in social networks. Dynamic Games Appl., 1--47. DOI:http://dx.doi.org/10.1007/s13235-010-0004-110.1007/s13235-010-0004-1.Google ScholarGoogle Scholar
  2. Daron Acemoglu, Giacomo Como, Fabio Fagnani, and Asuman Ozdaglar. 2010a. Opinion fluctuations and disagreement in social networks. LIDS Tech. rep. 2850. MIT. DOI:http://web.mit.edu/asuman/www/documents/disagreementsubmitted.pdf. LIDS.Google ScholarGoogle Scholar
  3. D. Acemoglu, M. A. Dahleh, I. Lobel, and A. Ozdaglar. 2010b. Bayesian learning in social networks. Rev. Econ. Stud. 78, 4, 1201--1236.Google ScholarGoogle ScholarCross RefCross Ref
  4. Daron Acemoglu, Asuman Ozdaglar, and Ali Parandehgheibi. 2011. Spread of misinformation in social networks. Dynamic Games Appl. 1, 1, 3--49.Google ScholarGoogle ScholarCross RefCross Ref
  5. Louigi Addario-Berry and Tao Lei. 2012. The mixing time of the Newman: Watts small world. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’12). SIAM, 1661--1668. http://dl.acm.org/citation.cfm?id=2095116.2095247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. David Aldous and Jim Fill. 1994. Reversible Markov chains and random walks on graphs. http://stat-www.berkeley.edu/~aldous/RWG/book.html.Google ScholarGoogle Scholar
  7. N. T. J. Bailey. 1975. The Mathematical Theory of Infectious Diseases 2nd. Ed. Hafner, New York.Google ScholarGoogle Scholar
  8. Abhijit V. Banerjee. 1992. A simple model of herd behavior. Quart. J. Econ. 107, 797--817.Google ScholarGoogle ScholarCross RefCross Ref
  9. Frank M. Bass. 1969. A new product growth for model consumer durables. Manage. Sci. 15, 215--227.Google ScholarGoogle Scholar
  10. D. D. Chinellato, M. A. M.d. Aguiar, I. R. Epstein, D. Braha, and Y. Bar-Yam. 2007. Dynamical response of networks under external perturbations: Exact results. http://arxiv.org/abs/0705.4607.Google ScholarGoogle Scholar
  11. Peter Clifford and Aidan Sudbury. 1973. A model for spatial conflict. Biometrika 60, 3, 581--588.Google ScholarGoogle ScholarCross RefCross Ref
  12. J. Theodore Cox and David Griffeath. 1986. Diffusive clustering in the two dimensional voter model. Ann. Probab. 14, 2, 347--379.Google ScholarGoogle ScholarCross RefCross Ref
  13. M. H. DeGroot. 1974. Reaching a consensus. J. Am. Stat. Assoc. 69, 118--121.Google ScholarGoogle ScholarCross RefCross Ref
  14. Odo Diekmann, Richard Durrett, Karl Hadeler, Philip Maini, Hal Smith, and Rick Durrett. 1999. Stochastic spatial models. In Mathematics Inspired by Biology, Lecture Notes in Mathematics, Vol. 1714, Springer, Berlin, 39--94.Google ScholarGoogle Scholar
  15. Malcolm Gladwell. 2002. The Tipping Point: How Little Things Can Make a Big Difference. Back Bay Books.Google ScholarGoogle Scholar
  16. Benjamin Golub and Matthew O. Jackson. 2010. Naive learning in social networks and the wisdom of crowds. Am. Econ. J. Microecon. 2, 1, 112--49.Google ScholarGoogle ScholarCross RefCross Ref
  17. L. Gray. 1986. Duality for general attractive spin systems with applications in one dimension. Ann. Probab. 14, 371--396.Google ScholarGoogle ScholarCross RefCross Ref
  18. Richard A. Holley and Thomas M. Liggett. 1975. Ergodic theorems for weakly interacting infinite systems and the voter model. Ann. Probab. 3, 4, 643--663.Google ScholarGoogle ScholarCross RefCross Ref
  19. Matthew O. Jackson. 2008. Social and Economic Networks 1st. Ed. Princeton University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Jacod and P. Protter. 2000. Probability Essentials. Springer.Google ScholarGoogle Scholar
  21. Michael Kearns and Jinsong Tan. 2008. Biased voting and the democratic primary problem. In Proceedings of the 4th International Workshop on Internet and Network Economics (WINE’08). Springer-Verlag, Berlin, 639--652. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. David Kempe, Jon Kleinberg, and Eva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’03). ACM, New York, NY, 137--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. David Kempe, Jon Kleinberg, and Eva Tardos. 2005. Influential nodes in a diffusion model for social networks. In Proceedings of the 32nd International Cellogium on Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 3580, Springer Verlag, Berlin, 1127--1138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. W. Kermack and A. McKendrick. 1991. Contributions to the mathematical theory of epidemics: Further studies of the problem of endemicity. Bull. Math. Bio. 53, 1, 89--118.Google ScholarGoogle Scholar
  25. Jon Kleinberg. 2007. Cascading Behavior in Networks: Algorithmic and Economic Issues. Cambridge University Press. http://www.cs.cornell.edu/home/kleinber/agtbook-ch24.pdf.Google ScholarGoogle Scholar
  26. P. L. Krapivsky. 1992. Kinetics of monomer-monomer surface catalytic reactions. Phys. Rev. A 45, 2, 1067--1072. DOI:http://dx.doi.org/10.1103/PhysRevA.45.1067.Google ScholarGoogle ScholarCross RefCross Ref
  27. David A. Levin, Yuval Peres, and Elizabeth L. Wilmer. 2006. Markov Chains and Mixing Times. American Mathematical Society.Google ScholarGoogle Scholar
  28. Thomas M. Liggett. 2005. Interacting Particle Systems. Springer, Berlin.Google ScholarGoogle Scholar
  29. Mauro Mobilia. 2003. Does a single zealot affect an infinite group of voters? Phy. Rev. Lett. 91, 2.Google ScholarGoogle ScholarCross RefCross Ref
  30. M. Mobilia, A. Petersen, and S. Redner. 2007. On the role of zealotry in the voter model. J. Stat. Mechanics: Theory Exp.Google ScholarGoogle Scholar
  31. J. R. Norris. 1998. Markov Chains (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press.Google ScholarGoogle Scholar
  32. E. Seneta. 1981. Non-negative Matrices and Markov Chains. Springer Series in Statistics.Google ScholarGoogle Scholar
  33. V. Sood and S. Redner. 2005. Voter model on heterogeneous graphs. Phy. Rev. Lett. 94, 17.Google ScholarGoogle ScholarCross RefCross Ref
  34. J. N. Tsitsiklis. 1984. Problems in decentralized decision making and computation. Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, MA.Google ScholarGoogle Scholar
  35. Fang Wu and Bernardo A. Huberman. 2004. Social structure and opinion formation. In Computational Economics 0407002, EconWPA.Google ScholarGoogle Scholar

Index Terms

  1. Binary Opinion Dynamics with Stubborn Agents

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Economics and Computation
      ACM Transactions on Economics and Computation  Volume 1, Issue 4
      December 2013
      96 pages
      ISSN:2167-8375
      EISSN:2167-8383
      DOI:10.1145/2542174
      Issue’s Table of Contents

      Copyright © 2013 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 December 2013
      • Accepted: 1 March 2013
      • Revised: 1 December 2012
      • Received: 1 November 2011
      Published in teac Volume 1, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader