Majority-Vote Model on Scale-Free Hypergraphs

T. Gradowski, and A. Krawiecki Faculty of Physics, Warsaw University of Technology, Koszykowa 75, PL-00662 Warsaw, Poland

Full Text PDF

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).

DOI: 10.12693/APhysPolA.127.A-55 PACS numbers: 89.75.Hc, 64.60.Cn, 05.10.Ln, 05.50.+q, 64.60.F-