Mapping the $q$-voter model: From a single chain to complex networks

Abstract

We propose and compare six different ways of mapping the modified $q$-voter model to complex networks. Considering square lattices, Barabási-Albert, Watts-Strogatz and real Twitter networks, we ask the question if always a particular choice of the group of influence of a fixed size $q$ leads to different behavior at the macroscopic level. Using Monte Carlo simulations we show that the answer depends on the relative average path length of the network and for real-life topologies the differences between the considered mappings may be negligible.

16 pages, 7 figures

References in corpus (7)

• Statistical physics of social dynamics
• Voter Models on Heterogeneous Networks
• Path lengths, correlations, and centrality in temporal networks
• Some new results on one-dimensional outflow dynamics
• Irrelevance of information outflow in opinion dynamics models
• Inflow versus outflow zero-temperature dynamics in one dimension
• An analytical expression for the exit probability of the q-voter model in one dimension

Cited by in corpus (5)

• Statistical Physics Of Opinion Formation: is it a SPOOF?
• Pair approximation for the q-voter model with independence on complex networks
• Threshold $q$-voter model
• The interplay between conformity and anticonformity and its polarizing effect on society
• Impact of independence on polarization of opinions