A signed graph offers richer information than an unsigned graph, since it describes both collaborative and competitive relationships in social networks. In this paper, we study the opinion dynamics on a signed graph, based on the Friedkin-Johnsen model. We first interpret the equilibrium opinion in terms of a defined random walk on an augmented signed graph, by representing the equilibrium opinion of every node as a combination of all nodes' internal opinions, with the coefficient of the internal opinion for each node being the difference of two absorbing probabilities. We then quantify some relevant social phenomena and express them in terms of the $\ell_2$ norms of vectors. We also design a nearly-linear time signed Laplacian solver for assessing these quantities, by establishing a connection between the absorbing probability of random walks on a signed graph and that on an associated unsigned graph. We further study the opinion optimization problem by changing the initial opinions of a fixed number of nodes, which can be optimally solved in cubic time. We provide a nearly-linear time algorithm with error guarantee to approximately solve the problem. Finally, we execute extensive experiments on sixteen real-life signed networks, which show that both of our algorithms are effective and efficient, and are scalable to massive graphs with over 20 million nodes.

翻译：带符号图比无符号图提供了更丰富的信息，因为它描述了社交网络中协作与竞争两种关系。本文基于Friedkin-Johnsen模型研究带符号图上的意见动力学。我们首先通过在扩展带符号图上定义随机游走，将每个节点的均衡意见解释为所有节点内在意见的组合，其中每个节点内在意见的系数为两个吸收概率之差。随后，我们量化了若干相关社会现象，并用向量的$\ell_2$范数进行表达。通过建立带符号图与对应无符号图上随机游走吸收概率之间的联系，我们设计了一种近线性时间的带符号拉普拉斯求解器以评估这些量。进一步，我们研究了通过改变固定数量节点的初始意见来实现意见优化的问题，该问题可在三次时间内求得最优解。我们提出了一种具有误差保证的近线性时间算法来近似求解该问题。最后，我们在十六个真实带符号网络上进行了大量实验，结果表明我们的两种算法均高效有效，且能扩展到具有超过2000万个节点的大规模图。