The Complexity of Finding Effectors
The NP-hard Effectors problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation processes in social networks. In the corresponding model the arcs carry probabilities and there is a probabilistic diffusion process activating nodes by neighboring activated nodes with probabilities as specified by the arcs. The point is to explain a given network activation state as well as possible by using a minimum number of “effector nodes”; these are selected before the activation process starts. We correct, complement, and extend previous work from the data mining community by a more thorough computational complexity analysis of Effectors, identifying both tractable and intractable cases. To this end, we also exploit a parameterization measuring the “degree of randomness” (the number of ‘really’ probabilistic arcs) which might prove useful for analyzing other probabilistic network diffusion problems as well.
KeywordsProbabilistic information propagation Influence maximization Network activation Social networks Exact algorithms Parameterized complexity
We are grateful to two anonymous reviewers of Theory of Computing Systems whose careful and constructive feedback helped to significantly improve the presentation of the paper.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)Google Scholar
- 2.Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)Google Scholar
- 3.Askalidis, G., Berry, R.A., Subramanian, V.G.: Explaining snapshots of network diffusions Structural and hardness results. In: proceedings of the 20th International Conference on Computing and Combinatorics, volume 8591 of LNCS, pp 616–625. Springer (2014)Google Scholar
- 7.Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: proceedings of the Third International Workshop on Internet and Network Economics, volume 4858 of LNCS, pp 306–311. Springer (2007)Google Scholar
- 9.Cygan, M., Fomin, F. V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms. springer (2015)Google Scholar
- 10.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)Google Scholar
- 11.Downey, R.G., Fellows, M.R.: Fundamentals of parameterized complexity. springer (2013)Google Scholar
- 13.Flum, J., Grohe, M.: Parameterized complexity theory, springer (2006)Google Scholar
- 15.Lappas, T., Terzi, E., Gunopulos, D., Mannila, H.: Finding effectors in social networks. In: proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1059–1068. ACM (2010)Google Scholar
- 17.Niedermeier, R.: Invitation to Fixed-Parameter algorithms. oxford university press (2006)Google Scholar