How Did You Get to Know That? A Traceable Word-of-Mouth Algorithm

Word-of-mouth communication has been shown to play a key rolein a variety of environments such as viral marketing and virusspreading. A family of algorithms, generally known as informationspreading algorithms or word-of-mouth algorithms, has beendeveloped to characterize such behavior. However, they havelimitations, including the inability to: (1) capture when the communicationsor contacts take place and (2) explain where the influencecomes from. These drawbacks have limited the studiesabout how the spreading of influence takes place in social networks.In this paper, we present a new word-of-mouth algorithmthat considers the temporality of the communications and keepstrack of how influence travels over the social network. We validatethe proposed algorithm via simulations of word-of-mouthtraces on call detailed records, in order to model how influencespreads. Our results indicate that (1) static factors of social networksare not enough to model influence and (2) there seems to bestatistical invariants of how influence spreads in a network.

[1]  Cristobald de Kerchove D'Exaerde,et al.  Social leaders in graphs , 2006 .

[2]  David M. Pennock,et al.  Winners don't take all: Characterizing the competition for links on the web , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Christos Faloutsos,et al.  Mobile call graphs: beyond power-law and lognormal distributions , 2008, KDD.

[4]  Sougata Mukherjea,et al.  Social ties and their relevance to churn in mobile telecom networks , 2008, EDBT '08.

[5]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[6]  Georg Lausen,et al.  Spreading activation models for trust propagation , 2004, IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004.

[7]  Harald Gruber,et al.  Competition and Innovation: The Diffusion of Mobile Telecommunications in Central and Eastern Europe , 2000, Inf. Econ. Policy.

[8]  Luca Becchetti,et al.  A Comparison of Sampling Techniques for Web Graph Characterization , 2006 .

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[11]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[12]  Ramon Huerta,et al.  Contact tracing and epidemics control in social networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Rajmonda Sulo Caceres,et al.  The Impact of Structural Changes on Predictions of Diffusion in Networks , 2008, 2008 IEEE International Conference on Data Mining Workshops.

[14]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .