Reducibility of higher-order to pairwise interactions: Social impact models on hypergraphs

Abstract

We show that a general class of social impact models with higher-order interactions on hypergraphs can be exactly reduced to an equivalent model with pairwise interactions on a weighted projected network. This reduction is made by a mapping that preserves the microscopic probabilities of changing the state of the nodes. As a particular case, we introduce hypergraph-voter models, for which we compute the weights of the projected network both analytically and numerically across several hypergraph ensembles, and we characterize their ordering dynamics through simulations of both higher-order and reduced dynamics. For a linear social impact function (hypergraph-linear voter model) the weights of the projected network are static, allowing us to develop a pair approximation that describes with accuracy the time evolution of macroscopic observables, which turn out to be independent of those weights. The macroscopic dynamics is thus equivalent to that of the standard voter model on the unweighted projected network. For a power-law social impact function (hypergraph-nonlinear voter model) the weights of the projected network depend on the instantaneous system configuration. Nevertheless, the nonlinear voter model on the unweighted projected network still reproduces the main macroscopic trends for well connected hypergraphs.

References in corpus (26)

• Statistical physics of social dynamics
• Epidemic processes in complex networks
• Networks beyond pairwise interactions: structure and dynamics
• The physics of higher-order interactions in complex systems
• Simplicial models of social contagion
• Voter Model on Heterogeneous Graphs
• Cascade Dynamics of Multiplex Propagation
• Voter model dynamics in complex networks: Role of dimensionality, disorder and degree distribution
• Incomplete ordering of the voter model on small-world networks
• Social contagion models on hypergraphs
• Random walks on hypergraphs
• Conservation laws for the voter model in complex networks
• Binary-state dynamics on complex networks: pair approximation and beyond
• Analytical Solution of the Voter Model on Disordered Networks
• Analytical results for the Sznajd model of opinion formation
• Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
• Accuracy of Mean-Field Theory for Dynamics on Real-World Networks
• Hypergraph reconstruction from network data
• Heterogeneous pair approximation for voter models on networks
• Pair approximation for the q-voter model with independence on complex networks
• Modelling Non-Linear Consensus Dynamics on Hypergraphs
• Fragmentation transitions in a coevolving nonlinear voter model
• Weighted projected networks: mapping hypergraphs to networks
• The distribution of the number of node neighbors in random hypergraphs
• Breaking coexistence: Zealotry vs. nonlinear social impact
• Universality of noise-induced transitions in nonlinear voter models