@inproceedings{5201a1771edd45ddaf6e535d6d4a7514,

title = "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 Effectors, identifying both tractable and intractable cases. To this end, we also exploit a parameterization measuring the “degree of randomness” (the number of {\textquoteleft}really{\textquoteright} probabilistic arcs) which might prove useful for analyzing other probabilistic network diffusion problems.",

author = "Laurent Bulteau and Stefan Fafianie and Vincent Froese and Rolf Niedermeier and Nimrod Talmon",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 ; Conference date: 18-05-2015 Through 20-05-2015",

year = "2015",

month = jan,

day = "1",

doi = "10.1007/978-3-319-17142-5_20",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "224--235",

editor = "Rahul Jain and Sanjay Jain and Frank Stephan",

booktitle = "Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings",

address = "Germany",

}