Majority-Vote Model on Scale-Free Hypergraphs
Majority-Vote Model on Scale-Free Hypergraphs
复制标题
无标度超图上的多数投票模型
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
A. Krawiecki
中科院分区：
文献类型：
--
作者：
T. Gradowski;A. Krawiecki
通过数值模拟研究了无标度超图上的多数投票模型，并采用不同的系统动力学模型。超图是普通图的推广，其中通过引入对应于社会群体的超边，连接两个以上的节点，包括更高阶的社会组织。在所研究的模型中，放置在节点上的代理（双态自旋）的意见根据概率规则更新，控制参数代表社会噪声。单次自旋翻转的概率取决于代理人所属的一个社会群体（超边缘）内的平均意见。这引入了一个中间层次的社会互动，与网络的情况相反，在网络中，代理人的意见通常取决于所有邻居的平均意见。在所有的情况下，考虑一个二阶相变的状态与统一的意见被发现作为社会噪声的函数，与控制参数的临界值和临界指数取决于超图的拓扑结构和详细的系统动态（节点或超边更新）。
Majority-vote models on scale-free hypergraphs are investigated by means of numerical simulations with different variants of system dynamics. Hypergraphs are generalisations of ordinary graphs in which higher order of social organisation is included by introducing hyperedges corresponding to social groups, connecting more than two nodes. In the models under study, opinions of agents (two-state spins) placed in nodes are updated according to a probabilistic rule with control parameter representing social noise. The probability of a single spin flip depends on the average opinion within only one social group (hyperedge) the agent belongs to. This introduces an intermediate level of social interactions, in contrast with the case of networks, where the opinion of an agent usually depends on the average opinion of all neighbours. In all cases under consideration a second-order phase transition to a state with an uniform opinion was found as a function of the social noise, with the critical value of the control parameter and the critical exponents depending on the hypergraph topology and details of the system dynamics (node or hyperedge update).