arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.2434cs.SIcs.DSphysics.soc-ph
收藏

具有竞争产品的社交网络中的扩散

Diffusion in Social Networks with Competing Products

Krzysztof R. Apt, Evangelos Markakis

摘要:

本文提出了一种新的社交网络阈值模型,在该模型中,受邻居影响的节点可以从多个选择中选择一个。我们的图形,通过整个网络的产品是可能的(分别是必要的)和一个独特的结果是保证。这些特征直接产生多项式时间算法,使我们能够确定给定的社交网络是否满足上述属性之一。我们还研究了没有唯一结果的网络的算法问题。我们表明,计算产品的最小可能的传播的问题是NP-难近似的近似比$Ω(n)$,在对比的最大传播,这是有效的可计算的。然后,我们继续讨论关于节点在采用一些(分别是)给定的)产品。我们表明,问题的确定是否一个给定的节点必须采取一些(分别。所有最终网络中的乘积是共NP完全的。

英文摘要:

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 the graphs 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 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. We then move on to questions regarding the behavior of a node with respect to adopting some (resp. a given) product. We show that the problem of determining whether a given node has to adopt some (resp. a given) product in all final networks is co-NP-complete.

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

↑