Abstract
As one of the essential problems in information diffusion process, how to select a set of influential nodes as the starting nodes has been studied by lots of researchers. All the existing solutions focus on how to maximize the influence of the initially selected “influential nodes”, paying no attention on how the influential nodes selection could maximize the speed of the diffusion. In this paper, we consider the problem of influential nodes selection regarding to the propagation speed in social network information diffusion. We define a discrete optimization problem, called Fast Information Propagation Problem. We show that this problem is NP-hard problem when the time requirement for information propagation is exactly 1-hop. We also propose a Latency-bounded Minimum Influential Node Selection Algorithm to solve the problem in this case.
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
Aspnes, J., Chang, K., Yampolskiy, A.: Inoculation Strategies for Victims of Viruses and the Sum-of- Squares Partition Problem. In: SODA 2005, pp. 43–52 (2005)
Berger, E.: Dynamic Monopolies of Constant Size. Journal of Combinatorial Theory B 83(2), 191–200 (2001)
Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the Spread of Viruses on the Internet. In: SODA 2005, pp. 301–310 (2005)
Domingos, P., Richardson, M.: Mining the Network Value of Customers. In: KDD 2001, pp. 57–66 (2001)
Dezso, Z., Barabasi, A.-L.: Halting Viruses in Scale-Free Networks. Physical Review E 65 (2002)
Du, D.-Z., Ko, K.-I., Hu, X.: Design and Analysis of Approximation Algorithms (unpublished Lecture Notes)
Eubank, S., Anil Kumar, V.S., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (2004)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12, 211–223 (2001)
Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: Proceedings of the 7th International World Wide Web Conference, pp. 107–117 (2004)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)
Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, pp. 1371–1376 (2007)
Morris, S.: Contagion. Review of Economic Studies 67, 57–78 (2000)
Pastor-Satorras, R., Vespignani, A.: Epidemics and Immunization in Scale-Free Networks. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of Graphs and Networks: From the Genome to the Internet, pp. 111–130. Wiley-VCH (2003)
Peleg, D.: Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review. In: Proceedings of the 3rd Colloquium on Structural Information & Communication Complexity, pp. 170–179 (1996)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70 (2002)
Watts, D.J.: A simple model of global cascades on random networks. Proceedings of National Academy of Science 99, 5766–5771 (2002)
Wang, F., Camacho, E., Xu, K.: Positive influence dominating set in online social networks. In: COCOA 2009 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zou, F., Zhang, Z., Wu, W. (2009). Latency-Bounded Minimum Influential Node Selection in Social Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)