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

复杂网络上具有独立性的q-选民模型的对逼近

Pair approximation for the q-voter model with independence on complex networks

Arkadiusz Jędrzejewski

摘要:

本文研究了复杂网络上具有独立性随机噪声的q-选民模型。使用对近似,我们提供了一个全面的,数学描述其行为,并推导出临界点的公式。通过蒙特卡罗实验验证了分析结果。对近似预测表现出实质性的协议与模拟,特别是对网络的弱聚类和大的平均度。尽管如此,对于接近q的平均度,还是产生了一些差异。这是我们第一次意识到,所提出的方法已被应用到非线性选民动态噪声。到目前为止,分析结果只得到了一个完整的图。我们表明,在限制的情况下,对近似的预测与已知的解决方案完全连接的网络。

英文摘要:

We investigate the q-voter model with stochastic noise arising from independence on complex networks. Using the pair approximation, we provide a comprehensive, mathematical description of its behavior and derive a formula for the critical point. The analytical results are validated by carrying out Monte Carlo experiments. The pair approximation prediction exhibits substantial agreement with simulations, especially for networks with weak clustering and large average degree. Nonetheless, for the average degree close to q, some discrepancies originate. It is the first time we are aware of that the presented approach has been applied to the nonlinear voter dynamics with noise. Up till now, the analytical results have been obtained only for a complete graph. We show that in the limiting case the prediction of pair approximation coincides with the known solution on a fully connected network.

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

↑