arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.04564cs.SIcs.AIcs.DS
收藏

选民模型的一种推广:有影响力的节点与收敛性质

A Generalisation of Voter Model: Influential Nodes and Convergence Properties

Indian Institute of Science(印度科学研究院);School of Computing, The Australian National University(澳大利亚国立大学计算机学院)

Abhiram Manohara, Ahad N. Zehmakan

AI总结:

本文推广选民模型以刻画连接强度差异、中立意见和不愿更新意见等现实特征,研究蓝色种子节点选择以最大化蓝色节点期望数量的问题,证明其 NP 难并给出最优近似保证的多项式时间算法,同时分析了模型的收敛性质。

摘要:

考虑一个表示社交网络的无向图 G,其中每个节点为蓝色或红色,分别对应关于某个话题的正面或负面意见。在选民模型中,在离散时间轮次中,每个节点均匀随机地选择一个邻居并采用其颜色。尽管该模型非常流行,但它并未捕捉到一些基本的现实世界特征,例如个体连接强度的差异、对话题持中立意见的个体,以及不愿更新其意见的个体。为了解决这些问题,我们引入并研究了一种选民模型的推广。受竞选策略的启发,我们研究了选择一组蓝色种子节点以最大化若干轮次后蓝色节点期望数量的问题。我们证明该问题是 NP 难的,并提供了一个具有最佳可能近似保证的多项式时间近似算法。我们在真实世界和合成图数据上的实验表明,所提出的算法优于其他算法。我们还研究了该模型的收敛性质。我们证明该过程可能需要指数数量的轮次才能收敛。然而,如果我们将自己限制在强连通图上,则收敛时间是多项式的,并且周期(收敛中的状态数)整除图中所有环的长度。

英文摘要:

Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at random and adopts its colour. Despite its significant popularity, this model does not capture some fundamental real-world characteristics such as the difference in the strengths of individuals connections, individuals with neutral opinion on a topic, and individuals who are reluctant to update their opinion. To address these issues, we introduce and study a generalisation of the voter model. Motivating by campaigning strategies, we study the problem of selecting a set of seeds blue nodes to maximise the expected number of blue nodes after some rounds. We prove that the problem is NP- hard and provide a polynomial time approximation algorithm with the best possible approximation guarantee. Our experiments on real-world and synthetic graph data demonstrate that the proposed algorithm outperforms other algorithms. We also investigate the convergence properties of the model. We prove that the process could take an exponential number of rounds to converge. However, if we limit ourselves to strongly connected graphs, the convergence time is polynomial and the period (the number of states in convergence) divides the length of all cycles in the graph.

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

↑