Diffusion in Social Networks with Competing Products

  • Krzysztof R. Apt
  • Evangelos Markakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)

Abstract

We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that allow us to determine whether a given social network satisfies one of the above properties.

We also study algorithmic questions for networks without unique outcomes. We show that the problem of computing the minimum possible spread of a product is NP-hard to approximate with an approximation ratio better than Ω(n), in contrast to the maximum spread, which is efficiently computable. We then move on to questions regarding the behavior of a node with respect to adopting some (resp. a given) product. We show that the problem of determining whether a given node has to adopt some (resp. a given) product in all final networks is co-NP-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: A note on competitive diffusion through social networks. Inf. Process. Lett. 110(6), 221–225 (2010)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Carnes, T., Nagarajan, C., Wild, S.M., van Zuylen, A.: Maximizing influence in a competitive social network: A follower’s perspective. In: Proc. 9th International Conference on Electronic Commerce (ICEC), pp. 351–360 (2007)Google Scholar
  5. 5.
    Chen, N.: On the approximability of influence in social networks. SIAM J. Discrete Math. 23(3), 1400–1415 (2009)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Easley, D., Kleinberg, J.: Networks, Crowds, and Markets. Cambridge University Press, Cambridge (2010)CrossRefMATHGoogle Scholar
  7. 7.
    Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12(3), 211–223 (2001)CrossRefGoogle Scholar
  8. 8.
    Granovetter, M.: Threshold models of collective behavior. American Journal of Sociology 83(6), 1420–1443 (1978)CrossRefGoogle Scholar
  9. 9.
    Immorlica, N., Kleinberg, J.M., Mahdian, M., Wexler, T.: The role of compatibility in the diffusion of technologies through social networks. In: ACM Conference on Electronic Commerce, pp. 75–83 (2007)Google Scholar
  10. 10.
    Jackson, M.: Social and Economic Networks. Princeton University Press, Princeton (2008)MATHGoogle Scholar
  11. 11.
    Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) KDD, pp. 137–146. ACM, New York (2003)Google Scholar
  12. 12.
    Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of mouth: Rumor dissemination in social networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185–196. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Morris, S.: Contagion. The Review of Economic Studies 67(1), 57–78 (2000)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: STOC, pp. 128–134 (2007)Google Scholar
  15. 15.
    Schelling, T.: Micromotives and Macrobehavior. Norton, New York (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Krzysztof R. Apt
    • 1
    • 2
  • Evangelos Markakis
    • 3
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.University of AmsterdamThe Netherlands
  3. 3.Dept. of InformaticsAthens University of Economics and BusinessAthensGreece

Personalised recommendations