arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.04715physics.soc-phcond-mat.stat-mech
收藏

噪声门限$q$ -选举人模型的对逼近

Pair approximation for the noisy threshold $q$-voter model

A. R. Vieira, Antonio F. Peralta, Raul Toral, Maxi San Miguel, C. Anteneodo

摘要:

在标准的$q$ -投票者模型中,一个给定的代理人只有在一个大小为$q$的影响力组内对相反的意见达成完全一致时才能改变它的意见。一个更现实的扩展是阈值$q$ -voter,其中最小的协议(至少$0<q_0\le q$相反的意见)足以翻转中央代理的意见,包括独立(非顺从者)选择的可能性。这个模型的变体,包括非一致性行为已经在完全连接的网络(平均场极限)中进行了研究。在这里,我们研究它的动态随机网络。特别是,而在平均场的情况下,它是无关的,是否允许在影响组中的重复,我们表明,这是不是在网络中的情况下,我们研究这两种情况下,有或没有重复的影响。此外,计算机模拟的结果进行了比较与预测的任意度分布的不相关网络的对近似。

英文摘要:

In the standard $q$-voter model, a given agent can change its opinion only if there is a full consensus of the opposite opinion within a group of influence of size $q$. A more realistic extension is the threshold $q$-voter, where a minimal agreement (at least $0<q_0\le q$ opposite opinions) is sufficient to flip the central agent's opinion, including also the possibility of independent (non conformist) choices. Variants of this model including non-conformist behavior have been previously studied in fully connected networks (mean-field limit). Here we investigate its dynamics in random networks. Particularly, while in the mean-field case it is irrelevant whether repetitions in the influence group are allowed, we show that this is not the case in networks, and we study the impact of both cases, with or without repetition. Furthermore, the results of computer simulations are compared with the predictions of the pair approximation derived for uncorrelated networks of arbitrary degree distributions.

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

↑