An Issue in the Martingale Analysis of the Influence Maximization Algorithm IMM

  • Wei ChenEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11280)


This paper explains a subtle issue in the martingale analysis of the IMM algorithm, a state-of-the-art influence maximization algorithm. Two workarounds are proposed to fix the issue, both requiring minor changes on the algorithm and incurring a slight penalty on the running time of the algorithm.



The author would like to thank Jian Li for helpful discussions and verification on the issue explained in the paper.


  1. 1.
    Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA (2014)Google Scholar
  2. 2.
    Chen, W.: An issue in the martingale analysis of the influence maximization algorithm IMM. Technical report arXiv:1808.09363 (2018)
  3. 3.
    Chen, W., Lakshmanan, L.V.S., Castillo C.: Information and Influence Propagation in Social Networks. Morgan & Claypool Publishers, San Rafael (2013)CrossRefGoogle Scholar
  4. 4.
    Chen, W., Teng, S.-H.: Interplay between social influence and network centrality: a comparative study on shapley centrality and single-node-influence centrality. In: WWW, pp. 967–976 (2017)Google Scholar
  5. 5.
    Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD (2010)Google Scholar
  6. 6.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD (2009)Google Scholar
  7. 7.
    Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM (2010)Google Scholar
  8. 8.
    Chung, F., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79–127 (2006)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: CIKM, pp. 629–638 (2014)Google Scholar
  10. 10.
    Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: ICDM (2011)Google Scholar
  11. 11.
    Huang, K., Wang, S., Bevilacqua, G.S., Xiao, X., Lakshmanan, L.V.S.: Revisiting the stop-and-stare algorithms for influence maximization. PVLDB 10(9), 913–924 (2017)CrossRefGoogle Scholar
  12. 12.
    Jung, K., Heo, W., Chen, W.: IRIE: scalable and robust influence maximization in social networks. In: ICDM (2012)Google Scholar
  13. 13.
    Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD (2003)Google Scholar
  14. 14.
    Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, New York (2005)Google Scholar
  15. 15.
    Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp. 695–710 (2016)Google Scholar
  16. 16.
    Sun, L., Huang, W., Yu, P., Chen, W.: Multi-round influence maximization. In: KDD (2018)Google Scholar
  17. 17.
    Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD (2015)Google Scholar
  18. 18.
    Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD (2014)Google Scholar
  19. 19.
    Yang, Y., Mao, X., Pei, J., He, X.: Continuous influence maximization: what discounts should we offer to social network users? In: SIGMOD (2016)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Microsoft ResearchBeijingChina

Personalised recommendations