arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.0819physics.soc-phcs.MAmath.CO
收藏

等间距智能体的Hegselmann-Krause动力学

The Hegselmann-Krause dynamics for equally spaced agents

Peter Hegarty, Edvin Wedin

摘要:

我们考虑Hegselmann-Krause有界置信动态n等距意见的真实线上,间隙等于置信界r,我们取为1。我们证明了严格的结果,这种配置的演变,这证实了假设先前所作的基础上模拟小值的n。也就是说,对于每个n,系统演化如下:在每5个时间步之后,一组3个代理在任一端断开连接,并在后续步骤中崩溃为集群。这种情况一直持续到中间剩下的代理少于6个,如果n不是6的倍数,这些代理最终会崩溃为一个集群。特别地,最终配置由2*[n/6]个大小为3的簇,加上一个大小为n(mod 6)的中间簇组成,如果n不是6的倍数,并且冻结之前的时间步数为5 n/6 + O(1)。我们还考虑了任意的,但恒定的,代理间间距d \in [0,1]的动态,并提出了三个主要的发现。首先,我们证明了在其他一些,但不是所有的,d值的演变也是周期性的,并提出了数值证据,为所有d的东西“接近”的周期性,但持有。其次,我们展示了一个d值,在这个值下,行为是周期性的,冻结的时间是n + O(1),因此比d = 1的时间慢。第三,我们提出的数值证据表明,d -> 0,冻结时间可能更接近,在数量级上,直径d(n-1)的配置,而不是代理的数量n。

英文摘要:

We consider the Hegselmann-Krause bounded confidence dynamics for n equally spaced opinions on the real line, with gaps equal to the confidence bound r, which we take to be 1. We prove rigorous results on the evolution of this configuration, which confirm hypotheses previously made based on simulations for small values of n. Namely, for every n, the system evolves as follows: after every 5 time steps, a group of 3 agents become disconnected at either end and collapse to a cluster at the subsequent step. This continues until there are fewer than 6 agents left in the middle, and these finally collapse to a cluster, if n is not a multiple of 6. In particular, the final configuration consists of 2*[n/6] clusters of size 3, plus one cluster in the middle of size n (mod 6), if n is not a multiple of 6, and the number of time steps before freezing is 5n/6 + O(1). We also consider the dynamics for arbitrary, but constant, inter-agent spacings d \in [0, 1] and present three main findings. Firstly we prove that the evolution is periodic also at some other, but not all, values of d, and present numerical evidence that for all d something "close" to periodicity nevertheless holds. Secondly, we exhibit a value of d at which the behaviour is periodic and the time to freezing is n + O(1), hence slower than that for d = 1. Thirdly, we present numerical evidence that, as d --> 0, the time to freezing may be closer, in order of magnitude, to the diameter d(n-1) of the configuration rather than the number of agents n.

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

↑