arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.06128cs.SIcs.CY
收藏

最大化领导者在社交网络中的影响

Maximizing Influence of Leaders in Social Networks

Xiaotian Zhou, Zhongzhi Zhang

摘要:

在社交网络中,添加边的操作经常被用于研究意见动态,其目的是多种多样的。在本文中,我们考虑的意见动力学的DeGroot模型的边缘添加问题的$n$节点和$m$边缘的社会网络中,在存在少量的$s \ll n$的竞争领导者的二元对立意见0或1。具体地说,我们提出和调查的问题,最大限度地提高均衡的整体意见,通过创建$k$新的边缘在候选边缘集,其中每个边缘是事件的1值的领导者和追随者节点。我们证明了目标函数是单调的和次模的。然后,我们提出了一个简单的贪婪算法的近似因子$(1-\frac{1}{e})$,近似解决问题的$O(n^3)$时间。此外,我们提供了一个快速算法的$(1-\frac{1}{e}-ε)$近似比和$\tilde{O}(mkε^{-2})$时间复杂度的任何$ε>0$,其中$\tilde{O}(\cdot)$符号抑制的${\rm poly} (\log n)$因素。大量的实验表明,我们的第二个近似算法是高效和有效的,它的规模超过一百万个节点的大型网络。

英文摘要:

The operation of adding edges has been frequently used to the study of opinion dynamics in social networks for various purposes. In this paper, we consider the edge addition problem for the DeGroot model of opinion dynamics in a social network with $n$ nodes and $m$ edges, in the presence of a small number $s \ll n$ of competing leaders with binary opposing opinions 0 or 1. Concretely, we pose and investigate the problem of maximizing the equilibrium overall opinion by creating $k$ new edges in a candidate edge set, where each edge is incident to a 1-valued leader and a follower node. We show that the objective function is monotone and submodular. We then propose a simple greedy algorithm with an approximation factor $(1-\frac{1}{e})$ that approximately solves the problem in $O(n^3)$ time. Moreover, we provide a fast algorithm with a $(1-\frac{1}{e}-ε)$ approximation ratio and $\tilde{O}(mkε^{-2})$ time complexity for any $ε>0$, where $\tilde{O}(\cdot)$ notation suppresses the ${\rm poly} (\log n)$ factors. Extensive experiments demonstrate that our second approximate algorithm is efficient and effective, which scales to large networks with more than a million nodes.

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

↑