The complexity of finding effectors

Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 ‘really’ probabilistic arcs) which might prove useful for analyzing other probabilistic network diffusion problems.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings
EditorsRahul Jain, Sanjay Jain, Frank Stephan
PublisherSpringer Verlag
Pages224-235
Number of pages12
ISBN (Electronic)9783319171418
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes
Event12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 - Singapore, Singapore
Duration: 18 May 201520 May 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9076
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015
Country/TerritorySingapore
CitySingapore
Period18/05/1520/05/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'The complexity of finding effectors'. Together they form a unique fingerprint.

Cite this