Measuring and Maximizing Influence via Random Walk in Social Activity Networks

With the popularity of OSNs, finding a set of most influential users (or nodes) so as to trigger the largest influence cascade is of significance. For example, companies may take advantage of the “word-of-mouth” effect to trigger a large cascade of purchases by offering free samples/discounts to those most influential users. This task is usually modeled as an influence maximization problem, and it has been widely studied in the past decade. However, considering that users in OSNs may participate in various kinds of online activities, e.g., giving ratings to products, joining discussion groups, etc., influence diffusion through online activities becomes even more significant.

[1]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[2]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[3]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[4]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[5]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[6]  Nicola Barbieri,et al.  Topic-aware social influence propagation models , 2012, Knowledge and Information Systems.

[7]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[8]  John C. S. Lui,et al.  Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework , 2015, Perform. Evaluation.

[9]  Donald F. Towsley,et al.  Measuring and maximizing group closeness centrality over disk-resident graphs , 2014, WWW.

[10]  Donald F. Towsley,et al.  A tale of three graphs: Sampling design on hybrid social-affiliation networks , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[11]  Huan Liu,et al.  mTrust: discerning multi-faceted trust in a connected world , 2012, WSDM '12.

[12]  Ken-ichi Kawarabayashi,et al.  Scalable similarity search for SimRank , 2014, SIGMOD Conference.

[13]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[14]  Shourya Roy,et al.  Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models , 2016, SIGMOD Conference.

[15]  S. Borgatti,et al.  The centrality of groups and classes , 1999 .

[16]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[17]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[18]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[19]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[20]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.