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

论影响力通过社交网络的非渐进传播

On the Non-Progressive Spread of Influence through Social Networks

MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab Mirrokni, Sina Sadeghian Sadeghabad

摘要:

社交网络中影响力的传播主要分为两类:渐进模型和非渐进模型(参见Kempe、Kleinberg和Tardos在KDD 2003中的开创性工作)。虽然渐进模型适合于对垄断环境中的影响力传播进行建模,但非渐进模型更适合于对非垄断环境进行建模,例如,对两种竞争技术在社交网络上的扩散进行建模。尽管对渐进模型进行了广泛的研究,但非渐进模型尚未得到很好的研究。在本文中,我们研究了在严格多数阈值下的非渐进模型的影响传播:给定一个图$G$与一组初始感染的节点,每个节点在时间$τ$被感染当且仅当它的大多数邻居在时间$τ-1$被感染。我们在\textit{MinPTS}问题中的目标是找到受感染节点的最小基数初始集,这些节点最终会收敛到稳定状态,其中$G$的所有节点都被感染。我们证明了,虽然MinPTS是NP-困难的一个有限的家庭图,它承认一个改进的常数因子近似算法的幂律图。我们这样做是通过证明在图中的节点的最小和最大程度的上下界。通过应用自然的贪心算法来实现上界。我们的实验评估的贪心算法也显示出其优越的性能相比,其他算法的一组现实世界的图,以及随机幂律图。最后,我们研究了这些算法的收敛性,并证明了非渐进模型收敛于最多$O(|E(G)|)$步骤。

英文摘要:

The spread of influence in social networks is studied in two main categories: the progressive model and the non-progressive model (see e.g. the seminal work of Kempe, Kleinberg, and Tardos in KDD 2003). While the progressive models are suitable for modeling the spread of influence in monopolistic settings, non-progressive are more appropriate for modeling non-monopolistic settings, e.g., modeling diffusion of two competing technologies over a social network. Despite the extensive work on the progressive model, non-progressive models have not been studied well. In this paper, we study the spread of influence in the non-progressive model under the strict majority threshold: given a graph $G$ with a set of initially infected nodes, each node gets infected at time $τ$ iff a majority of its neighbors are infected at time $τ-1$. Our goal in the \textit{MinPTS} problem is to find a minimum-cardinality initial set of infected nodes that would eventually converge to a steady state where all nodes of $G$ are infected. We prove that while the MinPTS is NP-hard for a restricted family of graphs, it admits an improved constant-factor approximation algorithm for power-law graphs. We do so by proving lower and upper bounds in terms of the minimum and maximum degree of nodes in the graph. The upper bound is achieved in turn by applying a natural greedy algorithm. Our experimental evaluation of the greedy algorithm also shows its superior performance compared to other algorithms for a set of real-world graphs as well as the random power-law graphs. Finally, we study the convergence properties of these algorithms and show that the non-progressive model converges in at most $O(|E(G)|)$ steps.

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

↑