Abstract
The following chapter aims to present the current research in the area of modelling and maximizing social influence in networks. Apart from describing the most popular models for this process, it focuses on presenting the advances in maximizing the spread of influence in social networks . Since most of the research was suited for static networks case, nowadays it is necessary to move it toward the networks that are everywhere around us—the dynamic ones. As is widely agreed in the scientific community, static networks are unacceptable simplification of the real world processes, so current research is moving toward the temporal networks. It is especially important when modelling propagation phenomena, such as the spread of influence, epidemics or diffusion of innovations. In this chapter it is presented how the research on maximizing the spread of influence is starting to explore real-world cases and how the early attempts of solving this problem for temporal networks look like. Moreover, it is shown how to benefit from the temporal properties of the social network in order to achieve better results for spread of influence compared to the static approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
References
Aggarwal, C.C., Lin, S., Philip, S.Y.: On influential node discovery in dynamic social networks. In: SDM, pp. 636–647. SIAM, Anaheim (2012)
Aral, S., Walker, D.: Identifying influential and susceptible members of social networks. Science 337(6092), 337–341 (2012)
Bakshy, E., Hofman, J.M., Mason, W.A., Watts, D.J.: Everyone’s an influencer: quantifying influence on twitter. In: Proceedings of the fourth ACM international conference on Web search and data mining, pp. 65–74. ACM (2011)
Barabási, A.L.: Bursts: The Hidden Patterns Behind Everything we do, From Your E-mail to Bloody Crusades. Penguin (2010)
Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. Knowl. Inf. Syst. 37(3), 555–584 (2013)
Barrat, A., Barthelemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. Proc. Natl. Acad. Sci. U.S.A. 101(11), 3747–3752 (2004)
Berger, E.: Dynamic monopolies of constant size. J. Comb. Theor. Ser. B 83(2), 191–200 (2001)
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Internet and Network Economics, pp. 306–311. Springer, Heidelberg (2007)
Bonchi, F.: Influence propagation in social networks: a data mining perspective. IEEE Intell. Inf. Bull. 12(1), 8–16 (2011)
Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Internet and Network Economics, pp. 539–550. Springer, Heidelberg (2010)
Bródka, P., Saganowski, S., Kazienko, P.: Ged: the method for group evolution discovery in social networks. Soc. Netw. Anal. Min. 3(1), 1–14 (2013)
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using k-shell decomposition. Proc. Natl. Acad. Sci. 104(27), 11150–11154 (2007)
Carrington, P.J., Scott, J., Wasserman, S.: Models and Methods in Social Network Analysis. Cambridge University Press, Cambridge (2005)
Cattuto, C., Van den Broeck, W., Barrat, A., Colizza, V., Pinton, J.F., Vespignani, A.: Dynamics of person-to-person interactions from distributed RFID sensor networks. PloS ONE 5(7), e11596 (2010)
Cha, M., Haddadi, H., Benevenuto, F., Gummadi, P.K.: Measuring user influence in twitter: the million follower fallacy. ICWSM 10, 10–17 (2010)
Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. arXiv:1204.3074 (2012)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029–1038. ACM (2010)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208. ACM (2009)
Clifford, P., Sudbury, A.: A model for spatial conflict. Biometrika 60(3), 581–588 (1973)
DallAsta, L., Baronchelli, A., Barrat, A., Loreto, V.: Nonequilibrium dynamics of language games on complex networks. Phys. Rev. E 74(3), 036105 (2006)
De Choudhury, M., Sundaram, H., John, A., Seligmann, D.D.: Social synchrony: predicting mimicry of user actions in online social media. In: Computational Science and Engineering, 2009. CSE’09. International Conference on, vol. 4, pp. 151–158. IEEE (2009)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM (2001)
Durrett, R., Durrett, R., Durrett, R., Durrett, R.: Lecture notes on particle systems and percolation. Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA (1988)
Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Pers. Ubiquitous Comput. 10(4), 255–268 (2006)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12(3), 211–223 (2001)
Goyal, A., Bonchi, F., Lakshmanan, L.V.: Learning influence probabilities in social networks. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, pp. 241–250. ACM (2010)
Goyal, A., Bonchi, F., Lakshmanan, L.V.: A data-based approach to social influence maximization. Proc. VLDB Endowment 5(1), 73–84 (2011)
Goyal, A., Bonchi, F., Lakshmanan, L.V., Venkatasubramanian, S.: On minimizing budget and time in influence propagation over social networks. Soc. Netw. Anal. Min. 3(2), 179–192 (2013)
Goyal, A., Lu, W., Lakshmanan, L.V.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World wide web, pp. 47–48. ACM (2011)
Goyal, A., Lu, W., Lakshmanan, L.V.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: Data Mining (ICDM), 2011 IEEE 11th International Conference on, pp. 211–220. IEEE (2011)
Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83(6), 1420 (1978)
Hedström, P., Bearman, P.: The Oxford Handbook of Analytical Sociology. Oxford University Press, Oxford (2009)
Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinite systems and the voter model. The Annals of Probability, pp. 643–663 (1975)
Holme, P., Saramäki, J.: Temporal networks. Phys. Rep. 519(3), 97–125 (2012)
Hughes, A.M.: Strategic Database Marketing. McGraw-Hill, New York (2006)
Jankowski, J., Michalski, R., Kazienko, P.: Compensatory seeding in networks with varying avaliability of nodes. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1242–1249. ACM (2013)
Javarone, M.A.: Social influences in the voter model: the role of conformity. arXiv preprint arXiv:1401.0839 (2014)
Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated annealing based influence maximization in social networks. In: AAAI (2011)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM (2003)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Automata, Languages and Programming, pp. 1127–1138. Springer, Heidelberg (2005)
Kindermann, R., Snell, J.L., et al.: Markov Random Fields and their Applications, vol. 1. American Mathematical Society Providence, R.I. (1980)
Klimt, B., Yang, Y.: The enron corpus: a new dataset for email classification research. In: Machine learning: ECML 2004, pp. 217–226. Springer, Heidelberg (2004)
Król, D.: On modelling social propagation phenomenon. In: N. Nguyen, B. Attachoo, B. Trawiński, K. Somboonviwat (eds.) Intelligent Information and Database Systems, Lecture Notes in Computer Science, vol. 8398, pp. 227–236. Springer, Heidelberg (2014)
Król, D.: Propagation phenomenon in complex networks: theory and practice. New Gener. Comput. 32(3–4), 187–192 (2014)
Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor graphs and the sum-product algorithm. Inf. Theor. IEEE Trans. 47(2), 498–519 (2001)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM (2007)
Li, C.T., Hsieh, H.P., Lin, S.D., Shan, M.K.: Finding influential seed successors in social networks. In: Proceedings of the 21st International Conference Companion on World Wide Web, pp. 557–558. ACM (2012)
Li, Y., Chen, W., Wang, Y., Zhang, Z.L.: Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 657–666. ACM (2013)
Liggett, T.M.: Interacting Particle Systems. Springer, Berlin (1985)
Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: ICDM, pp. 439–448 (2012)
Lu, Q., Korniss, G., Szymanski, B.K.: The naming game in social networks: community formation and consensus engineering. J. Econ. Interac. Coord. 4(2), 221–235 (2009)
Maity, S.K., Mukherjee, A., Tria, F., Loreto, V.: Emergence of fast agreement in an overhearing population: the case of the naming game. EPL (Europhysics Letters) 101(6), 68,004 (2013)
Masuda, N., Holme, P.: Predicting and controlling infectious disease epidemics using temporal networks. F1000Prime Reports 5, 6 (2013)
Mathioudakis, M., Bonchi, F., Castillo, C., Gionis, A., Ukkonen, A.: Sparsification of influence networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 529–537. ACM (2011)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Michalski, R., Kajdanowicz, T., Bródka, P., Kazienko, P.: Seed selection for spread of influence in social networks: Temporal versus static approach. New Gener. Comput. (2014) (in press)
Michalski, R., Palus, S., Kazienko, P.: Matching organizational structure and social network extracted from email communication. In: Business Information Systems, pp. 197–206. Springer, Berlin (2011)
Mobilia, M.: Commitment versus persuasion in the three-party constrained voter model. J. Stat. Phys. 151(1–2), 69–91 (2013)
Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31(2), 155–163 (2009)
Pathak, N., Banerjee, A., Srivastava, J.: A generalized linear threshold model for multiple cascades. In: 2010 IEEE 10th International Conference on, Data Mining (ICDM), pp. 965–970. IEEE (2010)
Peleg, D.: Local majority voting, small coalitions and controlling monopolies in graphs: a review. In: Proceedings of 3rd Colloquium on Structural Information and Communication Complexity, pp. 152–169 (1997)
Pfitzner, R., Scholtes, I., Garas, A., Tessone, C.J., Schweitzer, F.: Betweenness preference: quantifying correlations in the topological dynamics of temporal networks. Phys. Rev. Lett. 110(19), 198,701 (2013)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70. ACM (2002)
Rogers, T., Gross, T.: Consensus time and conformity in the adaptive voter model. Phys. Rev. E 88(3), 030,102 (2013)
Saito, K., Nakano, R., Kimura, M.: Prediction of information diffusion probabilities for independent cascade model. In: Knowledge-Based Intelligent Information and Engineering Systems, pp. 67–75. Springer, Berlin (2008)
Schelling, T.: Micromotives and Macrobehavior. WW Norton and Company, New York (1978)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)
Shakarian, P., Paulo, D.: Large social networks can be targeted for viral marketing with small seed sets. In: Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), pp. 1–8. IEEE Computer Society, Canada (2012)
Sun, J., Tang, J.: A survey of models and algorithms for social influence analysis. In: Social Network Data Analytics, pp. 177–214. Springer, New York (2011)
Tang, J., Sun, J., Wang, C., Yang, Z.: Social influence analysis in large-scale networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 807–816. ACM (2009)
Vanhems, P., Barrat, A., Cattuto, C., Pinton, J.F., Khanafer, N., Régis, C., Kim, B.a., Comte, B., Voirin, N.: Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PloS ONE 8(9), e73970 (2013)
Viswanath, B., Mislove, A., Cha, M., Gummadi, K.P.: On the evolution of user interaction in facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 37–42. ACM (2009)
Xie, J., Emenheiser, J., Kirby, M., Sreenivasan, S., Szymanski, B.K., Korniss, G.: Evolution of opinions on social networks in the presence of competing committed groups. PloS ONE 7(3), e33215 (2012)
Xie, J., Sreenivasan, S., Korniss, G., Zhang, W., Lim, C., Szymanski, B.K.: Social consensus through the influence of committed minorities. Phys. Rev. E 84(1), 011,130 (2011)
Ye, S., Wu, S.F.: Measuring Message Propagation and Social Influence on Twitter.com. Springer, Heidelberg (2010)
Zafarani, R., Abbasi, M.A., Liu, H.: Social Media Mining: An Introduction. Cambridge University Press, Cambridge (2014)
Zhang, W., Lim, C., Korniss, G., Szymanski, B.: Spatial Propagation of Opinion Dynamics: Naming Game on Random Geographic Graph. arXiv:1401.0115 (2013)
Acknowledgments
This work was partially supported by the fellowship co-financed by the European Union within the European Social Fund, by the European Commission under the 7th Framework Programme, Coordination and Support Action, Grant Agreement Number 316097, ENGINE—European research centre of Network intelliGence for INnovation Enhancement (http://engine.pwr.wroc.pl) and by The National Science Centre, the decision no. DEC-2013/09/B/ST6/02317. The calculations were carried out in Wroclaw Centre for Networking and Supercomputing (http://www.wcss.wroc.pl), grant No 177.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Michalski, R., Kazienko, P. (2015). Maximizing Social Influence in Real-World Networks—The State of the Art and Current Challenges. In: Król, D., Fay, D., Gabryś, B. (eds) Propagation Phenomena in Real World Networks. Intelligent Systems Reference Library, vol 85. Springer, Cham. https://doi.org/10.1007/978-3-319-15916-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-15916-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15915-7
Online ISBN: 978-3-319-15916-4
eBook Packages: EngineeringEngineering (R0)