Balancing the Spread of Two Opinions in Sparse Social Networks

by   Dušan Knop, et al.

Inspired by the famous Target Set Selection problem, we propose a new discrete model for simultaneously spreading several opinions within a social network and perform an initial study of its complexity. Here, we are given a social network, a seed-set of agents for each opinion, and two thresholds for each agent. The first threshold represents the willingness of an agent to adopt an opinion if the agent has no opinion at all, while the second threshold states for willingness to acquire second opinion. The goal is to add as few agents as possible to the initial seed-sets such that, once the process started with these seed-sets stabilizes, each agent has either both opinions or none. We show that the problem is NP-hard. Further, we investigate the complexity from the parameterized point-of-view. The problem is W[1]-hard with respect to the solution size. The problem remains W[1]-hard even for the combination of parameters the solution size and treewidth of the network even if all thresholds are at most 3, or the activation process stabilizes within 4 rounds. On the other hand, the problem is FPT when parameterized by the number of rounds, maximum threshold, and treewidth. This algorithm applies also for combined parameter treedepth and maximum threshold. Finally, we show that the problem is FPT when parameterized by vertex cover number of the input network alone. Our results also imply that the original Target Set Selection problem is FPT when parameterized by 3-PVC.



There are no comments yet.


page 1

page 3

page 11

page 13

page 15

page 17

page 29

page 31


Target set selection with maximum activation time

A target set selection model is a graph G with a threshold function τ:V→...

Solving Target Set Selection with Bounded Thresholds Faster than 2^n

In this paper we consider the Target Set Selection problem. The problem ...

On the Hardness of Opinion Dynamics Optimization with L_1-Budget on Varying Susceptibility to Persuasion

Recently, Abebe et al. (KDD 2018) and Chan et al. (WWW 2019) have consid...

Target Set Selection Parameterized by Clique-Width and Maximum Threshold

The Target Set Selection problem takes as an input a graph G and a non-n...

Parameterized Complexity of Immunization in the Threshold Model

We consider the problem of controlling the spread of harmful items in ne...

Importance of initial conditions in the polarization of complex networks

Most existing models of opinion formation use random initial conditions....

Weak dynamic monopolies in social graphs

Dynamic monopolies were already defined and studied for the formulation ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.