skip to main content
10.1145/2309996.2310024acmconferencesArticle/Chapter ViewAbstractPublication PageshtConference Proceedingsconference-collections
research-article

Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?

Published:25 June 2012Publication History

ABSTRACT

Online social networks (OSNs) have become one of the most effective channels for marketing and advertising. Since users are often influenced by their friends, "word-of-mouth" exchanges so-called viral marketing in social networks can be used to increases product adoption or widely spread content over the network. The common perception of viral marketing about being cheap, easy, and massively effective makes it an ideal replacement of traditional advertising. However, recent studies have revealed that the propagation often fades quickly within only few hops from the sources, counteracting the assumption on the self-perpetuating of influence considered in literature. With only limited influence propagation, is massively reaching customers via viral marketing still affordable? How to economically spend more resources to increase the spreading speed?

We investigate the cost-effective massive viral marketing problem, taking into the consideration the limited influence propagation. Both analytical analysis based on power-law network theory and numerical analysis demonstrate that the viral marketing might involve costly seeding. To minimize the seeding cost, we provide mathematical programming to find optimal seeding for medium-size networks and propose VirAds, an efficient algorithm, to tackle the problem on large-scale networks. VirAds guarantees a relative error bound of O(1) from the optimal solutions in power-law networks and outperforms the greedy heuristics which realizes on the degree centrality. Moreover, we also show that, in general, approximating the optimal seeding within a ratio better than O(log n) is unlikely possible.

References

  1. Alexa 2010. http://www.alexa.com/topsites.Google ScholarGoogle Scholar
  2. Facebook statistics 2010. http://www.facebook.com/press/info.php?statistics.Google ScholarGoogle Scholar
  3. W. Aiello, F. Chung, and L. Lu. A random graph model for massive graphs. In STOC '00, New York, NY, USA, 2000. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Aiello, F. Chung, and L. Lu. A random graph model for power law graphs. Experimental Math, 10:53--66, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  5. W. Aiello, F. Chung, and L. Lu. Random evolution in massive graphs. In In Handbook of Massive Data Sets. Kluwer Academic Publishers, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Arora and B. Barak. Computational complexity: a modern approach. Cambridge University Press, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Barabasi, R. Albert, and H. Jeong. Scale-free characteristics of random networks: the topology of the world-wide web. Physica A, 281, 2000.Google ScholarGoogle Scholar
  8. A. Barabasi, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, and T. Vicsek. Evolution of the social network of scientific collaborations. Physica A: Statistical Mechanics and its Applications, 311(3--4):590--614, 2002.Google ScholarGoogle Scholar
  9. M. Cha, A. Mislove, and K. P. Gummadi. A measurement-driven analysis of information propagation in the flickr social network. In WWW '09, pages 721--730, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. Chen. On the approximability of influence in social networks. SIAM Journal of Discrete Mathematics, 23(3):1400--1415, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD '09, pages 199--208, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data. SIAM Reviews, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. U. Feige. A threshold of ln n for approximating set cover. Journal of ACM, 45(4):634--652, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Ferrante. Hardness and approximation algorithms of some graph problems, 2006.Google ScholarGoogle Scholar
  15. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. WSDM '10, pages 241--250, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD'03, pages 137--146. ACM New York, NY, USA, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Kempe, J. Kleinberg, and E. Tardos. Influential nodes in a diffusion model for social networks. In ICALP '05, pages 1127--1138, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Leskovec, L. A. Adamic, and B. A. Huberman. The dynamics of viral marketing. ACM Trans. Web, 1, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In ACM KDD '07, pages 420--429, New York, NY, USA, 2007. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and Analysis of Online Social Networks. In IMC'07, San Diego, CA, October 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Peleg. Local majority voting, small coalitions and controlling monopolies in graphs: A review. In SIROCCO'96, pages 152--169, 1996.Google ScholarGoogle Scholar
  22. L. Rao. Toyota Turns To Twitter To Repair Its Image. http://techcrunch.com/2010/03/02/toyota-turns-totwitter-to-repair-its-image/, Mar. 2010.Google ScholarGoogle Scholar
  23. C. Shirky. The Political Power of Social Media: Technology, the Public Sphere, and Political Change, 2011.Google ScholarGoogle Scholar
  24. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In ACM STOC '01, pages 453--461, New York, NY, USA, 2001. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In WOSN'09, August 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. F. Wang, E. Camacho, and K. Xu. Positive influence dominating set in online social networks. In COCOA '09, pages 313--321, Berlin, Heidelberg, 2009. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. F. Zou, Z. Zhang, and W. Wu. Latency-bounded minimum influential node selection in social networks. In B. Liu, A. Bestavros, D.-Z. Du, and J. Wang, editors, WASA, LNCS, pages 519--526, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?

        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
        • Published in

          cover image ACM Conferences
          HT '12: Proceedings of the 23rd ACM conference on Hypertext and social media
          June 2012
          340 pages
          ISBN:9781450313353
          DOI:10.1145/2309996

          Copyright © 2012 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: 25 June 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          HT '12 Paper Acceptance Rate33of120submissions,28%Overall Acceptance Rate378of1,158submissions,33%

          Upcoming Conference

          HT '24
          35th ACM Conference on Hypertext and Social Media
          September 10 - 13, 2024
          Poznan , Poland

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader