Skip to main content

Naming Game Dynamics on Pairs of Connected Networks with Competing Opinions

  • Conference paper
  • First Online:
Social Informatics (SocInfo 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8852))

Included in the following conference series:

  • 3050 Accesses

Abstract

We study the Naming Game (NG) dynamics when two disjoint networks with nodes in consensus on competing opinions are connected with new links. We consider two sets of networks; one contains several networks with real-life communities, the other networks generated with the Watts-Strogatz and Barabási-Albert models. For each set, we run NG on all the possible pairs of networks and observe whether a consensus is reached to determine network features that correlate highly with such outcome. The main conclusion is that the quality of network community structure informs network’s ability to resist or exert influence from/on others. Moreover, the outcomes depend on whether Speaker-First of Listener-First NG is run and on whether a speaker or listener is biased towards high or low degree nodes. The results reveal strategies that may be used to enable and accelerate convergence to consensus in social networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Schellings, T.C.: Micromotives and Macrobehavior. Norton (1978)

    Google Scholar 

  2. Castellano, C., Fortunato, S., Loreto, V.: Statistical physics of social dynamics. Rev. Mod. Phys. 81, 591–646 (2009)

    Article  Google Scholar 

  3. Carr, J.: Applications of Centre Manifold Theory. Springer, US (1982)

    Google Scholar 

  4. Clifford, P., Sudbury, A.: A model for spatial conflict. Biometrika. 60, 581–588 (1973)

    MATH  MathSciNet  Google Scholar 

  5. Granovetter, M.: Threshold Models of Collective Behavior. Am. J. Sociol. 83, 1420–1443 (1978)

    Article  Google Scholar 

  6. Bass, F.M.: A New Product Growth for Model Consumer Durables. Manage. Sci. 15, 215–227 (1969)

    Article  MATH  Google Scholar 

  7. Steels, L.: A self-organizing spatial vocabulary. Artif. Life. 2, 319–332 (1995)

    Article  Google Scholar 

  8. Lu, Q., Korniss, G., Szymanski, B.K.: The Naming Game in social networks: community formation and consensus engineering. J. Econ. Interact. Coord. 4, 221–235 (2009)

    Article  Google Scholar 

  9. Dall’Asta, L., Baronchelli, A., Barrat, A., Loreto, V.: Nonequilibrium dynamics of language games on complex networks. Phys. Rev. E 74, 036105 (2006)

    Article  Google Scholar 

  10. Mazzitello, K.I., Candia, J., Dossetti, V.: Effects of Mass Media and Cultural Drift in a Model for Social Influence. Int. J. Mod. Phys. C 18, 10 (2006)

    Google Scholar 

  11. Candia, J., Mazzitello, K.I.: Mass media influence spreading in social networks with community structure (2008)

    Google Scholar 

  12. Mahadevan, P., Krioukov, D.: The Internet AS-level topology: three data sources and one definitive metric. In: ACM SIGCOMM (2006)

    Google Scholar 

  13. Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)

    Article  Google Scholar 

  14. Chen, M., Nguyen, T., Szymanski, B.: A new metric for quality of network community structure. ASE Hum. 2, 226–240 (2013)

    Google Scholar 

  15. Schecki, K., Holyst, J.: Bistable-monostable transitoin in the Ising model on two connected complex networks. Physical Review E, 031110 (2009)

    Google Scholar 

  16. Chen, M., Kuzmin, K., Szymanski, B.: Community Detection via Maximization of Modularity and Its Variants. IEEE Trans. Comput. Soc. Syst. 1, 46–65 (2014)

    Article  Google Scholar 

  17. R Core Team: R: A Language and Environment for Statistical Computing (2013). http://www.r-project.org/

  18. Lumley, T.: leaps: regression subset selection (2009). http://cran.r-project.org/package=leaps

  19. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U. S. A. 99, 7821–7826 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lusseau, D.: The emergent properties of a dolphin social network. Proc. R. Soc. London. Ser. B Biol. Sci. 270, S186–S188 (2003)

    Article  Google Scholar 

  21. Zachary, W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)

    Google Scholar 

  22. Newman, M.E.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. U. S. A. 98, 404–409 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Albert Trias Mansilla .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Trias Mansilla, A., Chen, M., Szymanski, B.K., de la Rosa Esteva, J.L. (2015). Naming Game Dynamics on Pairs of Connected Networks with Competing Opinions. In: Aiello, L., McFarland, D. (eds) Social Informatics. SocInfo 2014. Lecture Notes in Computer Science(), vol 8852. Springer, Cham. https://doi.org/10.1007/978-3-319-15168-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15168-7_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15167-0

  • Online ISBN: 978-3-319-15168-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics