arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0803.1686cond-mat.stat-mech
收藏

无序网络投票模型的解析解

Analytical Solution of the Voter Model on Disordered Networks

F. Vazquez, V. M. Eguiluz

摘要:

我们提出了一个数学描述的异构网络上的选民模型动态。当图的平均度为$μ\leq 2$时,系统指数快速地达到完全阶.对于$μ>2$,一个有限系统在完全有序化之前,处于准稳态,在准稳态中,存活运行中的活动链接(相反状态节点之间的链接)的平均密度是恒定的,等于$\frac{(μ-2)}{3(μ-1)}$,而一个无限大系统则无限地保持在部分有序的稳态活动状态。准稳态的平均寿命与达到完全有序状态的平均时间$T$成比例,其标度为$T \sim \frac{(μ-1) μ^2 N}{(μ-2) μ_2}$,其中$N$是网络的节点数,$μ_2$是度分布的二阶矩。我们发现这些分析结果和数值模拟的随机网络与各种程度的分布之间有很好的协议。

英文摘要:

We present a mathematical description of the voter model dynamics on heterogeneous networks. When the average degree of the graph is $μ\leq 2$ the system reaches complete order exponentially fast. For $μ>2$, a finite system falls, before it fully orders, in a quasistationary state in which the average density of active links (links between opposite-state nodes) in surviving runs is constant and equal to $\frac{(μ-2)}{3(μ-1)}$, while an infinite large system stays ad infinitum in a partially ordered stationary active state. The mean life time of the quasistationary state is proportional to the mean time to reach the fully ordered state $T$, which scales as $T \sim \frac{(μ-1) μ^2 N}{(μ-2) μ_2}$, where $N$ is the number of nodes of the network, and $μ_2$ is the second moment of the degree distribution. We find good agreement between these analytical results and numerical simulations on random networks with various degree distributions.

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

↑