Abstract
We consider the spread maximization problem that was defined by Domingos and Richardson [6,15]. In this problem, we are given a social network represented as a graph and are required to find the set of the most “influential” individuals that by introducing them with a new technology, we maximize the expected number of individuals in the network, later in time, that adopt the new technology. This problem has applications in viral marketing, where a company may wish to spread the rumor of a new product via the most influential individuals in popular social networks such as Myspace and Blogsphere.
The spread maximization problem was recently studied in several models of social networks [10,11,13]. In this short paper we study this problem in the context of the well studied probabilistic voter model. We provide very simple and efficient algorithms for solving this problem. An interesting special case of our result is that the most natural heuristic solution, which picks the nodes in the network with the highest degree, is indeed the optimal solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (Draft). Draft (2007)
Bass, F.M.: A new product growth model for consumer durables. Management Science 15, 215–227 (1969)
Brown, J.J., Reinegen, P.H.: Social ties and word-of-mouth referral behavior. Journal of Consumer Research
Clifford, P., Sudbury, A.: A model for spatial conflict. Biometrika 60(3), 581–588 (1973)
Coleman, J.S., Katz, E., Menzel, H.: Medical Innovations: A Diffusion Study. Bobbs Merrill (1966)
Domingos, P., Richardson, M.: Miningthe network value of customers. In: KDD, pp. 57–66 (2001)
Durrrett, R.: Lecture Notes on Particle Systems and Percolation. Wadsworth (1988)
Granovetter, M.: Threshold models of collective behavior. American Journal of Sociology 83(6), 1420–1443 (1978)
Holley, R.A., Liggett, T.M.: Ergodic theorems for weakly interacting infinite. systems and the voter model. Annals of Probability 3, 643–663 (1975)
Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)
Kempe, D., Kleinberg, J.M., Tardos, E.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)
Liggett, T.M.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer, Heidelberg (1999)
Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: STOC, pp. 128–134 (2007)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1996)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD, pp. 61–70 (2002)
Valente, T.: Network Models of the Diffusion of Innovations. Hampton Press (1995)
Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even-Dar, E., Shapira, A. (2007). A Note on Maximizing the Spread of Influence in Social Networks. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)