In this talk, we will discuss the extension of the adaptive voter model to hypergraphs. The adaptive voter model is a widely used model in statistical physics which describes the dynamics of opinion formation in societies. The hypergraph extension of this model allows us to capture more complex social effects like peer pressure that cannot be represented by traditional graphs.
We will introduce four different flavors of the hypergraph model and show how subtle differences between the update rules can lead to very different dynamics. Furthermore, we will derive the mean-field moment expansion equations for all four variants of the model. We will also introduce a moment-closure relation for hypergraph motifs as a generalization of the well-known pair approximation on graphs.