arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.5636cs.SIphysics.soc-ph
收藏

具有竞争产品的社交网络

Social Networks with Competing Products

Krzysztof R. Apt, Evangelos Markakis

摘要:

本文提出了一种新的社交网络阈值模型,在该模型中,受邻居影响的节点可以从多个选择中选择一个。我们的特点社交网络,通过整个网络的产品是可能的(分别是必要的)和一个独特的结果是有保证的。这些特征直接产生多项式时间算法,使我们能够确定给定的社交网络是否满足上述属性之一。我们还研究了没有唯一结果的网络的算法问题。我们证明,确定是否存在所有节点都采用某种积的最终网络的问题是NP完全的。反过来,确定给定节点是否在某些(相应地,所有)网络中采用某些(相应地,给定的)乘积的问题要么是co-NP完全的,要么可以在多项式时间内解决。此外,我们表明,计算产品的最小可能的传播的问题是NP-难近似的近似比$Ω(n)$,相反,最大的传播,这是有效的计算。最后,我们阐明了上述问题中的一些问题可以在多项式时间内解决时,只有两个产品。

英文摘要:

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 $Ω(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑