Encyclopedia of Big Data Technologies

2019 Edition
| Editors: Sherif Sakr, Albert Y. Zomaya

Influence Analytics in Graphs

  • Yuichi YoshidaEmail author
  • Panayiotis Tsaparas
  • Laks V. S. Lakshmanan
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-77525-8_325

Definitions

“Influence analytics in graphs” is the study of the dynamics of influence propagation over a network. Influence includes anything that can be transferred or shaped through network interactions, such as pieces of information, actions, behavior, or opinions. Influence analytics includes modeling of the process of influence propagation and addressing algorithmic challenges that arise in solving optimization problems related to the dynamic propagation process.

Overview

Diffusion process on networks is one of the most important dynamics studied in network analysis, which can represent social influence such as the word-of-mouth effect of a rumor in a social network, the spread of an infectious disease, opinion formation through social interaction, and many other phenomena that could happen online or off-line. Although diffusion process on networks has been studied from the 1960s, in various research areas including sociology and economy, its importance has grown considerably...

This is a preview of subscription content, log in to check access.

References

  1. Bindel D, Kleinberg JM, Oren S (2015) How bad is forming your own opinion? Games Econ Behav 92:248–265MathSciNetzbMATHCrossRefGoogle Scholar
  2. Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 946–957Google Scholar
  3. Castellano C, Fortunato S, Loreto V (2009) Statistical physics of social dynamics. Rev Mod Phys 81(2):591–646CrossRefGoogle Scholar
  4. Chen W, Lakshmanan LVS, Castillo C (2013) Information and influence propagation in social networks. Synthesis lectures on data management. Morgan & Claypool Publishers, San RafaelGoogle Scholar
  5. Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 795–804Google Scholar
  6. Degroot MH (1974) Reaching a consensus. J Am Stat Assoc 69(345):118–121zbMATHCrossRefGoogle Scholar
  7. Friedkin NE, Johnsen EC (1990) Social influence and opinions. J Math Sociol 15(3–4): 193–206zbMATHCrossRefGoogle Scholar
  8. Gionis A, Terzi E, Tsaparas P (2013) Opinion maximization in social networks. In: Proceedings of the 13th SIAM international conference on data mining (SDM), pp 387–395Google Scholar
  9. Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3): 211–223CrossRefGoogle Scholar
  10. Golshan B, Terzi E (2017) Minimizing tension in teams. In: Proceedings of the 26th ACM international conference on information and knowledge management (CIKM), pp 1707–1715Google Scholar
  11. Goyal A, Bonchi F, Lakshmanan LV (2010) Learning influence probabilities in social networks. In: Proceedings of the 3rd ACM international conference on web search and data mining (WSDM), pp 241–250Google Scholar
  12. Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420–1443CrossRefGoogle Scholar
  13. He X, Kempe D (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 885–894Google Scholar
  14. Hegselmann R, Krause U (2002) Opinion dynamics and bounded confidence models, analysis and simulation. J Artif Soc Soc Simul 5(3):1–33Google Scholar
  15. Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 137–146Google Scholar
  16. Matakos A, Terzi E, Tsaparas P (2017) Measuring and moderating opinion polarization in social networks. Data Min Knowl Disc 31(5):1480–1505MathSciNetCrossRefGoogle Scholar
  17. Nemhauser GL, Wolsey LA (1978) Best algorithms for approximating the maximum of a submodular set function. Math Oper Res 3(3):177–188MathSciNetzbMATHCrossRefGoogle Scholar
  18. Ohsaka N, Yoshida Y (2017) Portfolio optimization for influence spread. In: Proceedings of the 26th international conference on world wide web (WWW), pp 977–985Google Scholar
  19. Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. In: Proceedings of the 12th international conference on knowledge-based intelligent information and engineering systems (KES), pp 67–75Google Scholar
  20. Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data (SIGMOD), pp 75–86Google Scholar
  21. Zhang H, Dinh TN, Thai MT (2013) Maximizing the spread of positive influence in online social networks. In: Proceedings of the 33rd IEEE international conference on distributed computing systems (ICDCS), pp 317–326Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Yuichi Yoshida
    • 1
    Email author
  • Panayiotis Tsaparas
    • 2
  • Laks V. S. Lakshmanan
    • 3
  1. 1.National Institute of InformaticsTokyoJapan
  2. 2.Department of Computer Science and EngineeringUniversity of IoanninaIoanninaGreece
  3. 3.The University of British ColumbiaVancouverCanada