Group interactions

Empirical complex systems are widely assumed to be characterized not only by pairwise interactions, but also by higher-order (group) interactions that affect collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks’ superior descriptive power – compared to classical pairwise networks – comes with a much increased model complexity and computational cost. Consequently, it is of paramount importance to establish a quantitative method to determine when such a modeling framework is advantageous with respect to pairwise models, and to which extent it provides a parsimonious description of empirical systems. Here, we propose a principled method, based on information compression, to analyze the reducibility of higher-order networks to lower-order interactions, by identifying redundancies in diffusion processes while preserving the relevant functional information. The analysis of a broad spectrum of empirical systems shows that, although some networks contain non-compressible group interactions, others can be effectively approximated by lower-order interactions – some technological and biological systems even just by pairwise interactions. More generally, our findings mark a significant step towards minimizing the dimensionality of models for complex systems

The interplay between causal mechanisms and emerging collective behaviors is a central aspect of understanding, controlling, and predicting complex networked systems. In our work, we investigate the relationship between higher-order mechanisms and higher-order behavioral observables in two representative models with group interactions: a simplicial Ising model and a social contagion model. In both systems, we find that group (higher-order) interactions show emergent synergistic (higher-order) behavior. The emergent synergy appears only at the group level and depends in a complex, nonlinear way on the trade-off between the strengths of the low- and higher-order mechanisms and is invisible to low-order behavioral observables. Our work sets the basis for systematically investigating the relation between causal mechanisms and behavioral patterns in complex networked systems with group interactions, offering a robust methodological framework to tackle this challenging task.

The renormalization group is a pillar of the theory of scaling, scale invariance and universality in physics. Recently, this tool has been adapted to complex networks with pairwise interactions through a scheme based on diffusion dynamics. However, as the importance of polyadic interactions in complex systems becomes more evident, there is a pressing need to extend the renormalization group methods to higher-order networks. Here we fill this gap and propose a Laplacian renormalization group scheme for arbitrary higher-order networks. At the heart of our approach is the introduction of cross-order Laplacians, which generalize existing higher-order Laplacians by allowing the description of diffusion processes that can happen on hyperedges of any order via hyperedges of any other order. This approach enables us to probe higher-order structures, define scale invariance at various orders and propose a coarse-graining scheme. We validate our approach on controlled synthetic higher-order systems and then use it to detect the presence of order-specific scale-invariant profiles of real-world complex systems from multiple domains.

CompleX Group Interactions (XGI) is a library for analyzing higher-order networks. Such networks are used to model interactions of arbitrary size between entities in a complex system. This library provides methods for building hypergraphs and implicial complexes; algorithms to analyze their structure, visualize them, and simulate dynamical processes on them; and a collection of higher-order datasets. XGI is implemented in pure Python and integrates with the rest of the Python scientific stack. XGI is designed and developed by network scientists with the needs of network scientists in mind.

Single contagion processes are known to display a continuous transition from an epidemic-free phase at low contagion rates to the epidemic state for rates above a critical threshold. This transition can become discontinuous when two simple contagion processes are coupled in a bi-directional symmetric way. However, in many cases, the coupling is not symmetric and the processes can be of a different nature. For example, social behaviors—such as hand-washing or mask-wearing—can affect the spread of a disease, and their adoption dynamics via social reinforcement mechanisms are better described by complex contagion models, rather than by the simple contagion paradigm, which is more appropriate for disease spreading phenomena. Motivated by this example, we consider a simplicial contagion (describing the adoption of a behavior) that uni-directionally drives a simple contagion (describing a disease propagation). We show that, above a critical driving strength, such driven simple contagion can exhibit both discontinuous transitions and bi-stability, which are instead absent in standard simple contagions. We provide a mean-field analytical description of the phase diagram of the system, and complement the results with Markov-chain simulations. Our results provide a novel route for a simple contagion process to display the phenomenology of a higher-order contagion, through a driving mechanism that may be hidden or unobservable in many practical instances.