A gradient-based methodology for optimizing time for influence diffusion in social networks

  • Jyoti Sunil MoreEmail author
  • Chelpa Lingam
Original Article


In social network analysis, one of the significant problems is finding the most influential entities within the network, which has proved to be NP-hard. The problem of influence maximization in a social network is an optimization problem that ensures that the spread of influence in the network is maximized. Although many algorithms have been proposed for influence maximization, most of them provide influence spread, at the cost of execution time. Therefore, a novel methodology based on gradient approach is proposed in this paper to deal with the problem. This approach provides a balance between influence spread and execution time. In this research, the performance of the proposed algorithm has been compared with existing algorithms and observations of a better influence spread per second are presented. This task has significance in viral marketing, since the most influential entities can be targeted for endorsing new products in the market at a faster rate.


Gradient Social network analysis Social influencer Influence spread Influence diffusion Viral marketing 


  1. Amit Goyal W, Lu, Laxmanan LVS (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: ACM Proceeding WWW Proceedings of the 20th international conference companion on World wide webGoogle Scholar
  2. Bakshy E, MHofman J, Mason WA, Watts DJ (2011) Everyone’s an influencer: quantifying influence on twitter. In: WSDM proceedings of fourth ACM international conference on Web search and data mining,Google Scholar
  3. Castaon-Puga BYailMManuel, Castro JR, Suarez ED (2011) Fuzzy models applied to complex social systems: modeling poverty using distributed agencies. IJNCAA 1:292–303Google Scholar
  4. Chen D, LInyuan L, Shang MS, Zhang Y-C, Zhou T, (2011) Identifying influential nodes in complex networks. Phys A: Stat Mech Appl 391(4):1777–1787CrossRefGoogle Scholar
  5. Eytan Bakshy B, Karrer, Adamic L (2009) Social influence and the diffusion of user-created content. In Proceedings of the 10th ACM conference on Electronic commerceGoogle Scholar
  6. Flaviano B, Min L, Bo R, Hernan A (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Rep 6:30062CrossRefGoogle Scholar
  7. Goldenberg B, Libai E (2001a) Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad Market Sci Rev 5:1–18,Google Scholar
  8. Granovetter M (1978) Threshold models of collective behavior. Am J Soc 5:1420–1443,CrossRefGoogle Scholar
  9. Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques. Kaufmann Publishers, PittsburghzbMATHGoogle Scholar
  10. Jacob B, Libai E (2001b) Talk of the network: a complex systems look at the underlying process of word-of-mouth, Market Lett 5:211–223,Google Scholar
  11. Jure Leskovec A, Krause C, Guestrin C, Faloutsos J, VanBriesen, Glance N (2007a) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, KDD 07Google Scholar
  12. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network, In: KDD 03, USAGoogle Scholar
  13. Kimura M, Saito K, Nakano R, Motoda H (2009) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Disc (Springer),Google Scholar
  14. Kiss C, Bichler M (2008) Identification of influencers- measuring influence in customer networks. In: Decision Support Systems,Google Scholar
  15. Leskovec J, Faloutsos C (2007b) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1:1CrossRefGoogle Scholar
  16. Li N, Gillet D (2013) Identifying influential scholars in academic social media platforms”. In: ASONAM Proceedings IEEE/ACM international conference on advances in social network analysis and miningGoogle Scholar
  17. Lu Liu J, Tang J, Han, Yang S (2012) Learning influence from heterogeneous social networks. Data Min Knowl Disc(Springer),Google Scholar
  18. Mandt S, Hoffman MD, Blei DM (2017) Stochastic gradient descent as approximate bayesian inference. CoRR, abs/1704.04289,Google Scholar
  19. Morone F, Makse H (2015) Influence maximization in complex networks through optimal percolation. Nature 524:65–68CrossRefGoogle Scholar
  20. Murthy CA, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: 4th international conference on Pattern recognition and machine intelligence (PReMI11), Springer-Verlag, pp. 242–247,Google Scholar
  21. Papadopoulos Y, Kompatsiaris A, Spyridonos P (2012) Community detection in social media—performance and application considerations. Springer, BerlinGoogle Scholar
  22. Prabuchandran KJ, Narahari Y (2016) Information diffusion in social networks in two phases. IEEE Trans Netw Sci EngGoogle Scholar
  23. Sankar KPal, .Murthy SCA (2014) Centrality measures, upper bound, and influence maximization in large scale directed social networks. Fundamen Inf 130(1):317–342MathSciNetGoogle Scholar
  24. Tang L, Liu H (2011) Leveraging social media networks for classification. Springer, BerlinGoogle Scholar
  25. Teng J, Shaman F, Makse HA (2017) Efficient collective influence maximization in cascading processes with first-order transitions. Sci Rep 7:45240CrossRefGoogle Scholar
  26. Wang C, Chan W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks, data mining and knowledge discovery. Springer, BerlinGoogle Scholar
  27. Wei Pan W, Dong M, Cebrian T, Kim JH, Fowler, SandyPentland A (2012) Modeling dynamical influence in human interaction. In: ACM Transactions on the Web (ACM TWEB)Google Scholar
  28. Yuan K, Ling Q, Yin W (2013) On the convergence of decentralized gradient descent, arXiv preprint arXiv:1310.7063,Google Scholar
  29. Zhang H, Yin W (2013) Gradient methods for convex minimization: better rates under weaker conditions. UCLA CAM ReportGoogle Scholar

Copyright information

© Springer-Verlag GmbH Austria, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer Engineering, Ramrao Adik Institute of TechnologyAffiliated to Mumbai UniversityNavi MumbaiIndia
  2. 2.Pillai HOC College of Engineering and Technology, Affiliated to Mumbai UniversityRasayaniIndia

Personalised recommendations