Skip to Main content Skip to Navigation
Journal articles

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 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 Effec-tors, identifying both tractable and intractable cases. To this end, we also An extended abstract appeared in 2 Laurent Bulteau et al. 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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01494357
Contributor : Laurent Bulteau Connect in order to contact the contributor
Submitted on : Thursday, March 23, 2017 - 12:37:38 PM
Last modification on : Wednesday, November 3, 2021 - 8:29:55 AM
Long-term archiving on: : Saturday, June 24, 2017 - 12:35:41 PM

File

effectors_tocs.pdf
Files produced by the author(s)

Identifiers

Citation

Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon. The Complexity of Finding Effectors. Theory of Computing Systems, Springer Verlag, 2017, 60 (2), pp.253-279. ⟨10.1007/s00224-016-9670-8⟩. ⟨hal-01494357⟩

Share

Metrics

Record views

1307

Files downloads

614