On the convergence of nonlinear averaging dynamics with three-body interactions on hypergraphs
arXiv:2304.07203 · doi:10.1137/23M1568338
Abstract
Complex networked systems in fields such as physics, biology, and social sciences often involve interactions that extend beyond simple pairwise ones. Hypergraphs serve as powerful modeling tools for describing and analyzing the intricate behaviors of systems with multi-body interactions. Herein, we investigate a discrete-time nonlinear averaging dynamics with three-body interactions: an underlying hypergraph, comprising triples as hyperedges, delineates the structure of these interactions, while the vertices update their states through a weighted, state-dependent average of neighboring pairs' states. This dynamics captures reinforcing group effects, such as peer pressure, and exhibits higher-order dynamical effects resulting from a complex interplay between initial states, hypergraph topology, and nonlinearity of the update. Differently from linear averaging dynamics on graphs with two-body interactions, this model does not converge to the average of the initial states but rather induces a shift. By assuming random initial states and by making some regularity and density assumptions on the hypergraph, we prove that the dynamics converges to a multiplicatively-shifted average of the initial states, with high probability. We further characterize the shift as a function of two parameters describing the initial state and interaction strength, as well as the convergence time as a function of the hypergraph structure.
arXiv commentTo appear in SIAM Journal on Applied Dynamical Systems
References in corpus (15)
- Weak pairwise correlations imply strongly correlated network states in a neural population
- Networks beyond pairwise interactions: structure and dynamics
- Simplicial models of social contagion
- A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part I
- Three-body forces: From cold atoms to nuclei
- Fundamental structures of dynamic social networks
- A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part II
- Random walks on hypergraphs
- Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
- Graph partitions and cluster synchronization in networks of oscillators
- An adaptive voter model on simplicial complexes
- Modelling Non-Linear Consensus Dynamics on Hypergraphs
- Consensus on simplicial complexes, or: The nonlinear simplicial Laplacian
- Dynamics of Majority Rule on Hypergraphs
- Comparing Graph Spectra of Adjacency and Laplacian Matrices