Computer Science – Social and Information Networks
Scientific paper
2012-04-25
Computer Science
Social and Information Networks
30 pages. A preliminary version of this paper appeared as arXiv:1105.2434
Scientific paper
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize social networks for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that allow us to determine whether a given social network satisfies one of the above properties. We also study algorithmic questions for networks without unique outcomes. We show that the problem of determining whether a final network exists in which all nodes adopted some product is NP-complete. In turn, the problems of determining whether a given node adopts some (respectively, a given) product in some (respectively, all) network(s) are either co-NP complete or can be solved in polynomial time. Further, we show that the problem of computing the minimum possible spread of a product is NP-hard to approximate with an approximation ratio better than $\Omega(n)$, in contrast to the maximum spread, which is efficiently computable. Finally, we clarify that some of the above problems can be solved in polynomial time when there are only two products.
Apt Krzysztof R.
Markakis Evangelos
No associations
LandOfFree
Social Networks with Competing Products does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Social Networks with Competing Products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Social Networks with Competing Products will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-137893