Article

The dynamics of viral marketing

Authors:

Lada A. Adamic,

Bernardo A. HubermanAuthors Info & Claims

EC '06: Proceedings of the 7th ACM conference on Electronic commerce

Pages 228 - 237

https://doi.org/10.1145/1134707.1134732

Published: 11 June 2006 Publication History

Abstract

We present an analysis of a person-to-person recommendation network, consisting of 4 million people who made 16 million recommendations on half a million products. We observe the propagation of recommendations and the cascade sizes, which we explain by a simple stochastic model. We then establish how the recommendation network grows over time and how effective it is from the viewpoint of the sender and receiver of the recommendations. While on average recommendations are not very effective at inducing purchases and do not spread very far, we present a model that successfully identifies product and pricing categories for which viral marketing seems to be very effective.

References

[1]

Anonymous. Profiting from obscurity: What the long tail means for the economics of e-commerce. Economist, 2005.

[2]

E. Brynjolfsson, Y. Hu, and M. D. Smith. Consumer surplus in the digital economy: Estimating the value of increased product variety at online booksellers. Management Science, 49(11), 2003.

Digital Library

[3]

K. Burke. As consumer attitudes shift, so must marketing strategies. 2003.

[4]

J. Chevalier and D. Mayzlin. The effect of word of mouth on sales: Online book reviews. 2004.

[5]

P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 1960.

[6]

D. Gruhl, R. Guha, D. Liben-Nowell, and A. Tomkins. Information diffusion through blogspace. In WWW'04, 2004.

Digital Library

[7]

S. Jurvetson. What exactly is viral marketing? Red Herring, 78:110--112, 2000.

[8]

D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of infuence in a social network. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2003.

Digital Library

[9]

P. Killworth and H. Bernard. Reverse small world experiment. Social Networks, 1:159--192, 1978.

[10]

J. Leskovec, A. Singh, and J. Kleinberg. Patterns of influence in a recommendation network. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2006.

Digital Library

[11]

G. Linden, B. Smith, and J. York. Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76--80, 2003.

Digital Library

[12]

A. L. Montgomery. Applying quantitative marketing techniques to the internet. Interfaces, 30:90--108, 2001.

Digital Library

[13]

P. Resnick and R. Zeckhauser. Trust among strangers in internet transactions: Empirical analysis of ebays reputation system. In The Economics of the Internet and E-Commerce. Elsevier Science, 2002.

[14]

M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2002.

Digital Library

[15]

E. M. Rogers. Diffusion of Innovations. Free Press, New York, fourth edition, 1995.

[16]

D. Strang and S. A. Soule. Diffusion in organizations and social movements: From hybrid corn to poison pills. Annual Review of Sociology, 24:265--290, 1998.

[17]

J. Travers and S. Milgram. An experimental study of the small world problem. Sociometry, 1969.

[18]

D. Watts. A simple model of global cascades on random networks. PNAS, 99(9):4766--5771, Apr 2002.

Cited By

Li BHao DChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Core-Competitiveness in Partially Observable Networked MarketProceedings of the ACM Web Conference 202410.1145/3589334.3645555(156-166)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645555
Li BHao DZhao D(2024)Diffusion auction design with transaction costsAutonomous Agents and Multi-Agent Systems10.1007/s10458-023-09631-838:1Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1007/s10458-023-09631-8
Zeng LFan CChen C(2023)Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward ShapingMathematics10.3390/math1117369011:17(3690)Online publication date: 28-Aug-2023
https://doi.org/10.3390/math11173690
Show More Cited By

Index Terms

The dynamics of viral marketing
1. Applied computing
  1. Law, social and behavioral sciences
    1. Economics

Recommendations

The dynamics of viral marketing

We present an analysis of a person-to-person recommendation network, consisting of 4 million people who made 16 million recommendations on half a million products. We observe the propagation of recommendations and the cascade sizes, which we explain by ...
Viral Marketing: A Brief Study of Pre-Established Methods and Models for Understanding the Various Implications on the Corporate Sector

The paper explores how viral marketing plays a major role for the companies in the present scenario. This paper gives an insight into the various models to provide an overview into the mathematical aspect associated with viral marketing. At the end the ...
An Investigation of the Evaluation of the Viral Marketing Research

This paper aims to locate the key schools of thought in viral marketing VM literature, recognise the various sub-sets within viral marketing overall area of research and to identify the different gaps in viral marketing research literature offering a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

EC '06: Proceedings of the 7th ACM conference on Electronic commerce

June 2006

342 pages

ISBN:1595932364

DOI:10.1145/1134707

General Chair:
Joan Feigenbaum
Yale University, USA
,
Program Chairs:
John Chuang
University of California Berkeley, USA
,
David M. Pennock
Yahoo! Research, USA

Copyright © 2006 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 June 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

EC06

Sponsor:

EC06: ACM Conference on Electronic Commerce

June 11 - 15, 2006

Michigan, Ann Arbor, USA

Acceptance Rates

Overall Acceptance Rate 664 of 2,389 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

240
Total Citations
View Citations
1,668
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li BHao DChua TNgo CKa-Wei Lee RKumar RLauw H(2024)Core-Competitiveness in Partially Observable Networked MarketProceedings of the ACM Web Conference 202410.1145/3589334.3645555(156-166)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645555
Li BHao DZhao D(2024)Diffusion auction design with transaction costsAutonomous Agents and Multi-Agent Systems10.1007/s10458-023-09631-838:1Online publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1007/s10458-023-09631-8
Zeng LFan CChen C(2023)Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward ShapingMathematics10.3390/math1117369011:17(3690)Online publication date: 28-Aug-2023
https://doi.org/10.3390/math11173690
Saurabh SZehavi M(2023)Parameterized complexity of multi-node hubsJournal of Computer and System Sciences10.1016/j.jcss.2022.08.001131(64-85)Online publication date: Feb-2023
https://doi.org/10.1016/j.jcss.2022.08.001
Hajarathaiah KEnduri MAnamalamudi SSangi A(2023)Algorithms for Finding Influential People with Mixed Centrality in Social NetworksArabian Journal for Science and Engineering10.1007/s13369-023-07619-w48:8(10417-10428)Online publication date: 6-Feb-2023
https://doi.org/10.1007/s13369-023-07619-w
Wallinger MArchambault DAuber DNöllenburg MPeltonen J(2022)Edge-Path Bundling: A Less Ambiguous Edge Bundling ApproachIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2021.311479528:1(313-323)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1109/TVCG.2021.3114795
Xiao GLong ZChen YQin YWu F(2022)Row-Segmented Sparse-Dense Matrix Matrix Multiplication on GPUs2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta)10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00074(376-383)Online publication date: Dec-2022
https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00074
Schoenebeck GTao BYu F(2022)Think globally, act locally: On the optimal seeding for nonsubmodular influence maximizationInformation and Computation10.1016/j.ic.2022.104919285(104919)Online publication date: May-2022
https://doi.org/10.1016/j.ic.2022.104919
Li BHao DGao HZhao D(2022)Diffusion auction designArtificial Intelligence10.1016/j.artint.2021.103631303:COnline publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1016/j.artint.2021.103631
Li HZhang RLiu X(2022)An efficient discrete differential evolution algorithm based on community structure for influence maximizationApplied Intelligence10.1007/s10489-021-03021-x52:11(12497-12515)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s10489-021-03021-x
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents