The Complexity of Finding Effectors

Abstract : The NP-hard Effectors problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of (random) information-propagation processes. 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 best possible using a minimum number of " effector nodes " ; these are selected before the activation process starts. We complement and extend previous work from the data mining community by a more thorough computational complexity analysis of Effec-tors, 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Laurent Bulteau <>
Submitted on : Friday, January 22, 2016 - 2:00:43 PM
Last modification on : Tuesday, March 6, 2018 - 5:40:16 PM
Long-term archiving on: Friday, November 11, 2016 - 4:34:02 PM


Files produced by the author(s)




Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon. The Complexity of Finding Effectors. TAMC, 2015, Singapore, China. ⟨10.1007/978-3-319-17142-5_20⟩. ⟨hal-01260613⟩



Record views


Files downloads