Federico Battiston
email: battistonf@ceu.edu

Giulia Cencetti

Iacopo Iacopini

Vito Latora
email: v.latora@qmul.ac.uk

Maxime Lucas

Alice Patania

Jean-Gabriel Young

Giovanni Petri
email: giovanni.petri@isi.it

Networks beyond pairwise interactions: structure and dynamics

niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

I. INTRODUCTION

Any significant understanding of a complex system must rely on system level descriptions. Consider the following exercise: take an ecosystem, and break it into its pieces. No matter how good or accurate our knowledge at the level of the individual species is, chances are that our understanding of population dynamics (e.g. how the abundances of the different species change in time) will be slim at best. The same holds true when we attempt to explain epileptic seizures starting from the individual neurons of the human brain; or viral rumors spreading across societies from individual human psychology. All these approaches fail because they are missing a fundamental ingredient of any complex system, that is the rich pattern of nonlinear interactions between the system components. After many years of reductionism, science has abandoned the idea that the collective behaviors of a complex system can be simply understood and predicted by considering the units of the system in isolation [START_REF] Anderson | More is different[END_REF], and now more than ever is embracing the idea of complexity as one of the principles governing the world we live in.

Within this paradigm, networks have emerged as a reference modeling tool for complex systems [START_REF] Barabási | The network takeover[END_REF]. Networks are the maps that define the physical or virtual space where interactions take place. Add competitive and cooperative relationships to an ecosystem, synaptic connections to the human brain, and human interactions to rumor spreading, and readily the self-organizing patterns and the collective behavior we observe in nature begin to unravel and look less obscure. Building on earlier work in mathematics, social network analysis and ecology, a handful of breakthrough papers at the turn of the millennium has attracted the interest of the scientific community, triggering thousands of contributions over the last twenty years and leading to the formation of the new multidisciplinary field of Network Science. This new research community has developed an unusual mixture of graph theory and statistical mechanics into a flourishing discipline, with applications spanning the full range of science, from fundamental physics all the way to the social sciences. The boundaries and potential applications are yet to be fully realized [START_REF] Barabási | The network takeover[END_REF]. Still, the richness in scope and tools has already made the field of networks an independent discipline, often referred to as a science of its own. The growth of network science was also strengthened by the progressively wider availability of large datasets with detailed information on social, technological and biological interactions, which provided the raw material for the empirical validation of network models and predictions. We refer the reader interested in a first approach to network science to the several early review papers [START_REF] Albert | Statistical mechanics of complex networks[END_REF][START_REF] Dorogovtsev | Evolution of networks[END_REF][START_REF] Newman | The structure and function of complex networks[END_REF][START_REF] Boccaletti | Complex networks : Structure and dynamics[END_REF] and textbooks [START_REF] Newman | Networks: An Introduction[END_REF][START_REF] Estrada | The Structure of Complex Networks: Theory and Applications[END_REF][START_REF] Barabási | Network Science[END_REF][START_REF] Latora | Complex Networks: Principles, Methods and Applications[END_REF] on the subject.

As exploration of real-world systems deepens, network scientists are realizing the need to further characterize and enrich the relationships captured by a network description. This, however, creates problem: networks have originally been understood as a collection of nodes, representing the elementary units of the system, and edges, describing the existence of interactions between pairs of such units. Applications to real-world systems, however, require the possibility to describe more details of an interaction [START_REF] Carter | Revisiting the foundations of network analysis[END_REF], like for example: directed edges to describe the origin and destination of a message; edge weights, to highlight the intensity of an interaction; and even signs on the edges to distinguish whether a link encodes a productive or detrimental interaction among two units. In more recent years, a large effort has been devoted to formalize and develop the mathematical tools to analyze temporal networks, where interactions are not static but unfold in the temporal dimension [START_REF] Holme | Temporal networks[END_REF]. Similarly, many works have recently considered the case of interacting systems where units can be connected by links of different nature, and which can be effectively represented in terms of multiplex networks or multilayer networks [START_REF] Boccaletti | The structure and dynamics of multilayer networks[END_REF]. All these aspects have contributed in many cases to a better network representation, but are networks themselves enough to provide a complete description of a complex system?

The fundamental limit of networks is that they capture pairwise interactions only, while many systems display group interactions. Indeed, in social systems, ecology and biology among other examples, many connections and relationships do not take place between pairs of nodes, but rather are collective actions at the level of groups of nodes. For instance, three or more species routinely compete for food and territory in complex ecosystems [START_REF] Levine | Beyond pairwise mechanisms of species coexistence in complex communities[END_REF]. In other cases, the presence of a third species influences the interaction between other two, affecting directly the interaction (the link) rather than the species involved (the nodes). Similarly, social mechanisms, such as peer-pressure, inherently go beyond the idea of dyadic connections. Collective interactions are not an entirely new idea, and to some degree have appeared in early research on networks. Think for instance to the majority-rule model for the dynamics of opinion formation, or the public goods game in evolutionary game theory. In addition to these examples, one of the most successful streams of research in network science in recent years, complex contagion, naturally accounts for multiple simultaneous interactions [START_REF] Centola | The spread of behavior in an online social network experiment[END_REF]. However, in all cases these applications tried to leverage the language of pairwise networks to describe interactions of higher order, for example by using bipartite graphs [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF]. Can we instead find mathematical frameworks that can explicitly and naturally describes group interactions? Simplicial complexes and hypergraphs are the natural candidates to provide such descriptions. And indeed, over the last few years, a wave of enthusiasm for these representations has revolutionized our vision of and ability to tackle real-world systems characterized by more than simple dyadic connections. The importance of high-order interactions had been recognized already a long time ago [START_REF] Ronald H Atkin | From cohomology in physics to q-connectivity in social science[END_REF][START_REF] Berge | Graphs and hypergraphs[END_REF][START_REF] Atkin | Mathematical Structure in Human Affairs[END_REF], but this rejuvenated interest has brought a new, and much deeper understanding of higher-order representations. There are no doubts now that moving beyond dyadic interactions is fundamental to explain and predict collective behaviors that could not be described before.

The aim of this report is to provide a review of the state-of-the-art on the structure and dynamics of complex networks beyond pairwise interactions, as well as a reference and perspective on crucial open questions in the field. Together with this introduction, the report is organized as follows:

• The first part (Sections II to IV) focuses on the structure of systems with higher-order interactions. In particular,

Section II provides an introduction to the mathematical frameworks underlying higher-order representations. Section III describes the most common measures and properties currently used to describe the structure of systems with many-body interactions. Finally, Section IV reviews random models of higher-order systems and how they are used to make statistical inferences.

• The second part (Sections V to VIII) focuses on the dynamics of systems with higher-order interactions. In more detail, Section V discusses models of higher-order diffusion. Section VI describes the generalization of oscillator models and synchronization. Section VII introduces recent models of spreading in social systems with group structure. Section VIII reports on models of competition and cooperation among multiple agents.

• Finally, Section IX is an overview of real-world applications to systems with higher-order interactions. Our final conclusions and outlook are presented in Section X.

We conclude this preamble with a final remark. The idea to include higher-order interactions in network analysis is very simple. To this end, going beyond pairwise interactions might not look harder than attaching weights or signs to the edges of a graph. Yet, in practice, moving from pairs to a more complicated interaction structure is a difficult issue, and it requires a great deal of sophistication and novel mathematical tools. This explains why the analysis of this aspect of complex system has been heavily delayed compared to its weighted and signed, and even temporal and multilayer counterparts. After all, classical physics already knew this: while a closed-form solution is available for the two-body problem, solving for the trajectories of n interacting bodies given their positions and momenta is still an open problem! II. HIGHER-ORDER REPRESENTATIONS OF NETWORKS A. Elementary representations of higher-order interactions

Low-versus high-order representations

We begin by first defining more precisely what we consider as interactions and, as a consequence, as higher-order interactions. We define an interaction as a set I = [p 0 , p 1 , . . . , p k-1 ] containing an arbitrary number k of basic elements of the system under study, which we indicate as nodes or vertices. Such interactions can then describe different situations in real systems, e.g. the coauthors of a scientific paper, a set of genes required to perform a certain function, the coactivation of a group neurons during a specific task, etc. In a slightly counterintuive way, we will denote the order (or dimension) of an interaction involving k nodes to be k -1: a node interacting with itself only is a 0-order interaction, an interaction between two nodes has order 1, one among three nodes has order 2, and so on. Furthermore, we consider higher-order interactions to be k-interactions with k ≥ 2. Conversely, low order interactions are those characterized by k ≤ 1. In plain terms, low order systems are those in which only selfor pair-wise interactions take place (like edges in a graph), while higher-order systems (HOrSs, from now on) display interactions in groups of more than two elements.

The distinction between low-and high-order interactions is needed for two reasons. First, it highlights the differences between the graph-theoretic descriptions, that shaped the study of complex systems in recent decades, and the more recently (re)proposed descriptions based on genuine group interactions. Secondly, it allows us to clearly frame the connections between such descriptions, their various overlaps and reciprocal mappings. Finally, our definition explicitly leaves out other types of higher-order dependencies between the components of a system, as for example those defined by multiple link types in multilayer networks [START_REF] Boccaletti | The structure and dynamics of multilayer networks[END_REF][START_REF] Kivelä | Multilayer networks[END_REF][START_REF] Battiston | The new challenges of multiplex networks: Measures and models[END_REF][START_REF] Bianconi | Multilayer networks: structure and function[END_REF][START_REF] Aleta | Multilayer networks in a nutshell[END_REF], or by non-Markovian paths in time-stamped interaction data [START_REF] Holme | Temporal networks[END_REF][START_REF] Lambiotte | From networks to optimal higher-order models of complex systems[END_REF]. While these are out of the scope of this review, the interested reader can find an extensive discussion of these topics in the references mentioned above.

We define an interacting system (V, I) as the family of interactions I = {I 0 , . . . I n } taking place on a node set V . To aid the intuition, let us make a specific example. Consider the node set V = [a, b, c, d, e] and the set of interactions I = {[a, b, c], [a, d], [d, c], [c, e]} (Fig. 1A). I contains three 1-interactions and one 2-interaction. While the complete information about the systems is included in the list above, the study of most interesting properties of the system requires the choice of a representation. For example, measuring the collective effects of the interactions on a specific node requires the capacity to map interactions of different orders in a way that makes them comparable to each other; asking how dense the system is, or whether one node is reachable from another, again requires being able to compare in a controlled way interactions of different order and composition.

Graph-based representations

Graphs are the most common way to represent families of interactions (Fig. 1C). A graph G = (V, E) is defined by a nodeset V with n elements, and an edgeset E whose m elements are pairs of nodes. A graph is then a collection of edges connecting pairs of nodes. In other words, the building blocks of graph representations are 1-interactions, i.e. interactions of the type I = [i, j]. The most natural choice is then to unfold each higher-order interaction in I in terms of 1-interactions built from pairs of nodes in I. Under this assumption, our example b,c],[a,d],[d,c],[c,e]} maps to [b,c],[c,a],[a,d],[d,c],[c,e]} (Fig. 1B). This mapping makes systems amenable to be studied using tools developed in both graph theory [START_REF] John | Graph Theory with Applications[END_REF] and network science [START_REF] Newman | Networks: An Introduction[END_REF]. Indeed, graph representations enabled the growth, depth and breadth of results on real-world complex networks in the last two decades [START_REF] Estrada | The Structure of Complex Networks: Theory and Applications[END_REF][START_REF] Barabási | Network Science[END_REF][START_REF] Latora | Complex Networks: Principles, Methods and Applications[END_REF], with applications spanning biology [START_REF] Alon | Biological networks: The tinkerer as an engineer[END_REF][START_REF] Kashtan | Spontaneous evolution of modularity and network motifs[END_REF], ecology [START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF][START_REF] José | Ecological networks and their fragility[END_REF], social science [START_REF] Stephen P Borgatti | Network analysis in the social sciences[END_REF][START_REF] Miller Mcpherson | Birds of a feather: Homophily in social networks[END_REF], engineering [START_REF] Gao | Networks formed from interdependent networks[END_REF][START_REF] Sergey V Buldyrev | Catastrophic cascade of failures in interdependent networks[END_REF], neuroscience [START_REF] Bullmore | Complex brain networks: Graph theoretical analysis of structural and functional systems[END_REF][START_REF] Bassett | Network neuroscience[END_REF][START_REF] John D Medaglia | Cognitive network neuroscience[END_REF], all the way to cosmology [START_REF] Boguñá | Cosmological networks[END_REF].

I = {[a,
I G = {[a, b],
Despite the power of graph representations to capture many properties of complex interacting systems, their limits are easily identified: it is impossible to explicitly describe group interactions, or in other terms there is no direct relationship between I and I G nor any way to recover the former from the latter. For example, going back to our toy example, at the description level provided by I G , it is impossible to tell (and hence to describe) whether the original interaction set contained [a, c, d] or not. Naturally, in some cases networks can provide information on higher-order interactions, but these are always inferences based on the low order interactions, obtained for example by looking for very dense subsets of nodes using community [START_REF] Fortunato | Community detection in graphs[END_REF], clique [START_REF] Palla | Uncovering the overlapping community structure of complex networks in nature and society[END_REF] or block detection [START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF] techniques. However, such FIG. 1. Representations of higher-order interactions. A set of interactions of heterogeneous order (A) can be represented using only pairwise interactions (B). Using only low order blocks, the set of interactions can be described in th simplest way by using a graph (C). Alternatively, interactions can be encoded as nodes in one layer of a bipartite graph, where the other layer contains the interaction vertices (D). Other examples of high-order coordinated patterns can be encoded using motifs, small subgraphs with specific connectivity structures (E). Among motifs, cliques are especially popular as they represent the densest subgraphs, aking to higher order bricks (F). All these representations discard information that was present in the original interaction data (A). A solution is to consider explicitly higher order building blocks, in the form of simplices and hyperedges (G). Collection of simplices form simplicial complexes (H), which allow to discriminate between genuine higher order interactions and -even complex-sums of low order ones (I). Unfortunately, simplicial complexes, given a simplex, require the presence of all possible subsimplices (J), which can be too strong an assumption in some systems. Relaxing this condition effectively implies moving from simplices to hyperedges (K), which are the most general-and less constrained-representation of higher-order interactions (L).

reconstructions are often incomplete and rife with problems [START_REF] Lancichinetti | Limits of modularity maximization in community detection[END_REF][START_REF] Abbe | Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery[END_REF][START_REF] Lancichinetti | Benchmark graphs for testing community detection algorithms[END_REF].

Bipartite graph representations effectively describe group interactions. Solidly within the realms of low-order interactions, bipartite graphs are graphs defined by two nodesets (U, W ) and edgeset E containing only edges (u, w) such that u ∈ U and w ∈ W . To represent higher-order interactions, one chooses U to coincide with the original nodeset V , i.e. U = V , and W to coincide with the set of interactions I [START_REF] Guillaume | Bipartite structure of all complex networks[END_REF][START_REF] Guillaume | Bipartite graphs as models of complex networks[END_REF]. The links in the bipartite graph connect a node (in V ) to the interactions (of arbitrary order) in which it takes part (Fig. 1D). This representation emerges naturally in many fields: it is used for example in social sciences, where it provides a way to encode the membership of individuals to groups of different dimensions [START_REF] Wasserman | Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)[END_REF][START_REF] Newman | Random graph models of social networks[END_REF]; or to describe the collaboration of actors (nodes) in movies (interactions) [START_REF] Guimerà | Module identification in bipartite and directed networks[END_REF]; it is also used in ecological bipartite graphs, where species linked to a common prey represent competition for resources among more than two species [START_REF] José | Ecological networks and their fragility[END_REF]; in recommendation systems [START_REF] Zhou | Bipartite network projection and personal recommendation[END_REF] they describe the relations between customers and purchased products, and so on.

It is easy to see that the entire information in our toy model is preserved when interactions are described as a bipartite graph. In fact, this representation is very general and can indeed well mimic most interaction structures. However, at difference with other multilayer graph formulations [START_REF] Boccaletti | The structure and dynamics of multilayer networks[END_REF][START_REF] Kivelä | Multilayer networks[END_REF], in a bipartite graph the nodes of the original system do not interact directly with each other anymore. Rather, their relation is always mediated by the interaction layer, which is of a different nature from the node layer itself. This implies that any measure or dynamic process define on the bipartite representation needs to take into account this additional complexity. The usual workaround to this problem is to consider the unipartite networks obtained by projecting the bipartite on one of the two layers.

Each interaction becomes then a fully connected subgraph among the nodes belonging to the interaction, losing the group structure in the same way as in the simple graph case. In addition, it is usually impossible to translate the information contained in the standard graph operators (e.g. Laplacian) defined on a bipartite graph into the ones corresponding to the unipartite projections [START_REF] Zweig | A systematic approach to the one-mode projection of bipartite graphs[END_REF][START_REF] Michael | Flow smoothing and denoising: Graph signal processing in the edge-space[END_REF] Motifs allows to extract additional information on the properties of an interaction. They are the-usually smallrecurrent subgraphs of a given network, or of a class of networks of similar origin [START_REF] Milo | Network motifs: Simple building blocks of complex networks[END_REF]. Motifs are defined as specific patterns of edges (1-interactions) between vertices that appear to be statistically significant in the network (Fig. 1E). They are considered structural signatures of the function of a network. That is, different motifs can correspond and reflect different functions or different optimization solutions to the same function [START_REF] Alon | Network motifs: Theory and experimental approaches[END_REF]. Typically, the statistically validated frequencies (z-scores) with which the various motifs are observed in a network are collected into a motif profile, which can then be used for example to discriminate between different networks [START_REF] Austin R Benson | Higher-order organization of complex networks[END_REF], e.g. between brain functional networks in different states [START_REF] Sarah E Morgan | Low-dimensional morphospace of topological motifs in human fMRI brain networks[END_REF][START_REF] Avena-Koenigsberger | Network morphospace[END_REF] or between differently evolved biological networks [START_REF] Kashtan | Spontaneous evolution of modularity and network motifs[END_REF][START_REF] Alon | Network motifs: Theory and experimental approaches[END_REF][START_REF] Shai S Shen-Orr | Network motifs in the transcriptional regulation network of Escherichia coli[END_REF]. Motifs also found widespread application in the study of social [START_REF] James H Fowler | Model of genetic variation in human social networks[END_REF] and temporal [START_REF] Paranjape | Motifs in temporal networks[END_REF][START_REF] Kovanen | Temporal motifs in time-dependent networks[END_REF] systems.

Motifs constitute a refinement of the bipartite representation of a system, since, in addition to a division in groups akin to that of bipartite graphs, they allow to specify the interaction pattern in which a node is involved. The drawback to this is that the number of possible motifs to investigate grows exponentially with the number of nodes involved. This unfortunately makes them quite unwieldy as a descriptive tool for large graphs and/or motifs. As an example, generative models aimed to quantify randomness in networks via motif-based constraints [START_REF] Mahadevan | Systematic topology analysis and generation using degree correlations[END_REF] were shown to become very hard to manage, or even sample, for interactions above order 2 [START_REF] Orsini | Quantifying randomness in real networks[END_REF].

Because of the exponential growth in the number of motifs, a large part of the work on analyzing subgraphs focuses on a special type of motifs: cliques (Fig. 1F). A clique of size k is defined as a fully connected subgraph of k nodes. Here, we use size for cliques to avoid confusion, since a k-clique usually encodes an interaction of order k -1. The interest in cliques is justified also by the fact that they represent the most obvious definition of group from a network point of view, because they are the densest and most uniform motif [START_REF] Derényi | Clique percolation in random networks[END_REF]. Also, they directly encode the idea that every member of the clique interacts with every other [START_REF] Robin | Social networks, support cliques, and kinship[END_REF][START_REF] Keith | Networks within networks: Service link overlap, organizational cliques, and network effectiveness[END_REF]. Due to these properties, cliques are privileged building blocks of a network and its communities [START_REF] Palla | Uncovering the overlapping community structure of complex networks in nature and society[END_REF]. However, we can incur into problems if we want to use cliques to characterize higher-order interactions. In fact, going back to our toy example, we see that both sets a, b, c and a, d, c form 3-cliques. Conversely, in I G we only had a true 2-interaction, namely [a, b, c], while the fictitious interaction [a, d, c] is emerging as a byproduct of the union of the 1-interactions [a, d] and [d, c] with the [a, c] edge induced by [a, b, c]. We can see then that, by considering all cliques present at the graph level, we would "fill" a 2-interaction that was not included in the original interaction set. This is somewhat opposite to what happened when we considered the edges alone. In that case, we lost completely the notion of group. In the case of cliques instead, we risk "filling" too much and thus creating high-order interactions that were not there to begin with.

Explicit higher-order representations

To properly describe higher-order interactions, we need to encode them explicitly. Why not encoding interactions exactly as they are in fact? Simplices are the simplest mathematical objects to accomplishes this. The formal definition of simplices mimicks very closely the one we gave of higher-order interactions. In fact, a k-simplex σ is, in its most general form, just a set of k + 1 nodes σ = [p 0 , p 1 , . . . , p k ] (Fig. 1G). This notation is the standard one borrowed from the literature in algebraic topology [START_REF] Hatcherr | Algebraic topology[END_REF], where nodes are often points in a topological space. In applications where the interactions are purely combinatorial, one might want to draw attention to the interactions rather than to the underlying space. Thus, in these cases, nodes are often denominated as v 0 , v 1 , . . . to highlight that they are vertices of interactions, without any reference to an underlying space. The definition of dimension of a simplex coincides then with the definition of order of an interaction we gave earlier. Based on this parallel between the definitions of interactions and simplices, it is easy to see that we do not incur anymore in the problems described above. However, it is not clear how we can handle interactions of potentially different dimensions together and which are the advantages of such representations. Just like graphs are collections of edges, simplicial complexes are collections of simplices (Fig. 1H). At difference with graphs, they require further properties to be considered valid complexes: a collection of n simplices K = {σ 0 , σ 1 . . . σ n } is a valid simplicial complex if, for every k-simplex σ = [p 0 , p 1 , . . . , p k ] ∈ K, all its subfaces of any dimensions belong to K too. For example, if the triangle [a, b, c] ∈ K, then we also require [a], [b], [c], [a, b], [a, c], [b, c] to belong to K. Note that if we were to extract cliques from a graph and consider them as simplices (which is the operative definition of a clique complex ), it would be impossible to distinguish the two cases in which respectively the triangle was present or not. Using a simplicial formalism instead this distinction is immediate, as we only need to check whether the 2-interaction [a, b, c] is included in K (Fig. 1I). Simplicial descriptions are very powerful because they come equipped with many nice mathematical gadgets. It is in fact straight-forward to define Laplacian operators for any dimension on simplicial complexes [START_REF] Horak | Spectra of combinatorial Laplace operators on simplicial complexes[END_REF][START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF], they can approximate both regular manifolds and highly irregular structures [START_REF] Costa | Random simplicial complexes[END_REF][START_REF] Bianconi | Network geometry with flavor: From complexity to quantum geometry[END_REF], and they come naturally equipped with boundary operators stringing together simplices with different dimensions. Crucially, these operators describe the topology and shape of simplicial complexes in terms of their cycles, cavities and higher-order topological holes [START_REF] Ghrist | Elementary Applied Topology[END_REF] and are naturally related to the combinatorial Laplacians [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF]. In the following sections, we will describe many of these properties in greater detail, because they represent some the most powerful tools currently available and are the foundation of recent advances in topological data analysis [START_REF] Carlsson | Topology and data[END_REF][START_REF] Patania | Topological analysis of data[END_REF][START_REF] Expert | Editorial: Topological neuroscience[END_REF]. Although simplicial complexes overcome some of the problems encountered by other lower dimensional representations, they are still quite limited by the requirement on the existence of all subfaces. In some cases, this constraint is too restrictive. For instance, when studying social systems, it is important to be able to describe interactions in groups.

In this case we can use simplicial complexes as it is rather safe to assume that a group interaction also implies the underlying pairwise interactions (Fig. 1J). The relative importance of pairwise versus group interactions can then be encoded in weights over the simplices.

However, in other cases, the inclusion constraint can be less easily justified: suppose for example that we are studying collaborations in scientific papers, and we observe a paper by three authors and none by the corresponding pairs of authors; or gene pathways were exactly three genes are needed to perform a function, but the subgroups are not responsible for any function on their own. Clearly, it would be useful to be able to describe also these situations (Fig. 1K).

Hypergraphs provide the most general and unconstrained description of higher-order interactions. Formally, a hypergraph is defined by a nodeset V and a set of hyper-edges H that specify which nodes participate in which way within an interaction. Each hyper-edge is a non-empty subset of V . It is easy to see that hypergraphs are the most appropriate description of interacting systems (V, I) that we gave at the beginning of the section (Fig. 1L). Notice that a hypergraph can include the 2-interaction [a, b, c] without any requirement on the existence of 1-interactions [a, b], [a, c] and [b, c]. In fact, hypergraphs are so unconstrained that it is also possible to define hyperedges that include other hyperedges, e.g. given v, w, z ∈ V and γ = [v, w] ∈ H, it is possible to define a new hyperedge γ ′ = [z, w, v; γ] ∈ H. Such extreme flexibility comes, as expected, with an additional complexity in treating them. For example, while many graph-theoretic concepts can be extended to the case of hypergraphs, such an endevour is often fraught with complications [START_REF] Higuchi | Higher dimensional hypercategories[END_REF], to the point that a proper definition of Laplacian operators [START_REF] Louis | Hypergraph Markov operators, eigenvalues and approximation algorithms[END_REF] on hypergraphs and of their properties, e.g. the spectral diameter, has only emerged in the few last years [START_REF] Hubert Chan | Spectral properties of hypergraph Laplacian and approximation algorithms[END_REF][START_REF] Hubert | Generalizing the hypergraph Laplacian via a diffusion process with mediators[END_REF] and-to the best of our knowledge-has found few real world applications, e.g. degree-generating models [START_REF] Ghoshal | Random hypergraphs and their applications[END_REF] and hypergraph modularity [START_REF] Kumar | Hypergraph clustering: A modularity maximization approach[END_REF][START_REF] Chodrow | Annotated hypergraphs: Models and applications[END_REF].

B. Relations and links between representations

Naturally, many questions emerge when discussing different representations of the same interacting system: how much overlap is there among two different representations? Is it possible to map one onto another in a canonical way? What kind of information is preserved (and lost) when moving between representations? For example, it seems obvious that a simplicial complex composed only by 1-dimensional simplices (edges) should be the same thing as a graph, right? Well, it depends. Let us illustrate the links between representations starting from simplicial complexes (Fig. 2A). There are many ways of writing down a simplicial complex, but we focus here only on two descriptions, that are equally valid yet carry very different meanings: the Hasse diagram and the facet representation.

The Hasse diagram of a simplicial complex K is the directed acyclic graph HD(K) = (V HD , E HD ), whose nodeset V HD contains a node for each simplex in K (V HD = {σ}∀σ ∈ K), while the edgeset E HD contains an edge for each inclusion between simplices that differ in dimension by 1 . In other terms, for two simplices σ, τ ∈ K there exist an edge (σ, τ ) ∈ E HD iff σ ⊂ τ and dim(τ ) = dim(σ) + 1. In Fig. 2B we provide an example of a Hasse Diagram for a toy simplicial complex (Fig. 2A) . It is easy to see that the Hasse Diagram unfolds all the structure in the simplicial complex, by making explicit the hierarchy of simplices in the complex via its multipartite structure (one layer per dimension), and thus providing information about its internal organization. Importantly, it also gives an explicit way to walk on a simplicial complex: starting from a node (simplex), a walker can follow the links in the Hasse Diagram and explore the whole complex. It turns out that the structure of the Hasse Diagram directly relates to the generalization of the graph Laplacian to simplicial complexes and to random walks on complexes. We will describe this in detail in Sections III and V, but, even without the full theory, it is already possible to understand some of the FIG. 2. Relations among representations. A simplicial complex (A) is defined by the list of simplices that compose it. The structure of the natural inclusions between simplices can be described as a graph (B), where nodes correspond to simplices and edges the inclusions (in the figure, when two simplices are linked the top one contains the bottom one). Following the chain of inclusions upward, one reaches the maximal simplices, facets, that are not included in any larger simplex. These facets can be used to define a bipartite (or hypergraph) representation of the simplicial complex, identifying the facets with the hyperedges (C).

peculiarities of diffusion on simplicial complexes. The operators that link simplices that differ by ±1 in dimension, akin to the links in the Hasse Diagram, are (co)boundary operators. For example, given a triangle (2-simplex), the boundary returns a combination of the three edges that form the perimeter of the triangle. Taking its boundary again, however, gives zero, because a boundary has no boundary itself (just like in standard differential geometry). It is easy to see now that any operator built on top of such boundary operators, like the combinatorial Laplacian, will only be able to describe diffusion between adjacent simplices with co-dimension 1. Similarly, it is easy to imagine that operators defined on different representations are not necessarily equivalent, as for example shown recently by Schaub and Segarra [START_REF] Michael | Flow smoothing and denoising: Graph signal processing in the edge-space[END_REF], that found that the Laplacian built on a graph, on its line graph and on the corresponding 1-dimensional complex are not mutually exchangeable.

On the other extreme, the facet representation of a simplicial complex is the most parsimonious in terms of number of stored simplices. A facet for complex K is a simplex that is not contained in any other simplex in K. In the Hasse Diagram, facets correspond to nodes that are not included in any other. In Fig. 2B they are indicated as the simplices with an orange contour. In this sense, facets are akin to maximal cliques in graphs, and, just like maximal cliques, the list of facets of a complex uniquely identifies it. It is also a compressed description because it implies the existence of all the subsimplices without explicitly listing them. In truth, the facet representation is a directed bipartite graph under disguise, where facets constitute one layer, vertices the other, and directed edges represent inclusion of a node in a facet. It can also be recovered easily from the Hasse diagram, by keeping only the vertex layer and the simplices that have zero outdegree (i.e. without anything above themselves) . This bipartite graph associated to the facet representation can then also be studied as a hypergraph, where facet membership defines the hyperedges (Fig. 2C). Note that the converse is generally false: a bipartite graph (or hypergraph) gives rise to a simplicial complex in the facet representation only if no set of vertex nodes linked to a facet node (hyperedge) is a subset another set of nodes linked to another facet node (hyperedge); in short, the incident node sets of facets need to respect the non-inclusion properties of facets, or equivalently, no hyperedge can be included in another hyperedge.

III. MEASURES

In the previous section we have discussed the various ways and levels at which high-order interactions can be described and represented. In this section we will focus on observables and measures that can be used to characterize and quantify the structural properties of high-order interacting systems, at each level of their description. In particular, in the case of cliques, hyperedges, sets, or simplices, many common notions developed for ordinary graphs have been generalized to their higher-order counterparts. We will start by discussing how to describe interactions in terms of matrices or tensors. We will then show how standard graph-based measures have been generalized and what are the insights that can be extracted using them.

A. Matrix representations of higher-order systems

Incidence matrix

In mathematics, the incidence matrix is the classical way to describe the relationships between two classes of objects. First introduced by Kirchkoff in 1847 for applications to electrical circuits, the incidence matrix of a graph G = (V, E) is a n × m matrix I = {I iα }, where n is the number of nodes and m is the number of edges. The entry I iα in row i and column α is 1 if node i and edge α are incident, and zero otherwise. The definition can be easily extended to the case of higher-order interactions, in which case α labels the most general type of interaction HOrS (Fig. 3A). For example, in the case of hypergraphs, n is the total number of nodes while m is the number of hyperedges [START_REF] Berge | Graphs and hypergraphs[END_REF][START_REF] Estrada | Complex networks as hypergraphs[END_REF]. In particular, for hypergraphs allowing for a node to be represented more than once in each hyperedge, it can be useful to weight the entries of the incidence matrix. In this case then the nonzero entries of the incidence matrix would represent the number of times the vertex i is present in the relative hyperedge [START_REF] Bogumi L Kamiński | Clustering via hypergraph modularity[END_REF]. Notice that the incidence matrix can also be seen as the adjacency matrix of a bipartite graph with two node sets one of size n and one of size m (see Sec. II). In the case of simplicial complexes, the incidence matrix between nodes and simplices can be defined in the same way (Fig. 3B). In the following, we will use the language of hypergraphs whenever the definitions apply to simplicial complexes as well.

Incidence matrices come in handy when it comes to characterize the various properties of HOrSs. For instance, the degree of a node i in either a graph or a HOrS can be defined as the sum of the elements of the ith-row of the incidence matrix. In a (simple) graph the column of an incidence matrix always sums to 2 as the relationships described are always between two nodes of the graph. In a hypergraph (simplicial complex), however, the rows of the matrix can have more than two non-zero elements as each hyperedge (simplex) can describe interactions among more than two vertices. The sum of the elements of the columns of the incidence matrix define the size sequence of the hyperedges (simplices) of the system. These two local measures, the degree of the nodes and the size of the hyperedges, are the first measures one can use to study the properties of HOrSs.

Adjacency matrix

From the incidence matrix of a graph we can also construct another matrix that fully encodes the connectivity of the graph, the adjacency matrix A. Since the matrix product I ⋅ I T is a n × n matrix whose i, j element is the number of columns of the incidence matrix I that contain both vertices i and j, while i, i gives the degree of node i, the adjacency matrix of a simple graph can be defined as:

A = II T -D (1)
where D is the diagonal matrix whose diagonal entries are the nodes degrees. The adjacency matrix A is 0 along the diagonal, while for i ≠ j the entry a ij = 1 iff nodes i and j are adjacent, that is, there exists an edge connecting them. We can generalize the notion of adjacency matrix to the case of HOrSs by using the same expression in Eq. 1 and considering as D the diagonal matrix whose diagonal entries are the number of hyperedges a vertex belongs to. While for simple graphs there can be at most one edge connecting a pair of nodes i and j, for HOrSs there can be more than one hyperedge α containing the two nodes. The adjacency matrix of a HOrS is then a n × n matrix whose elements a ij are the number of hyperedges that contain both i and j (Figs. 3I,J for hypergraphs and simplicial complexes respectively). When the hyperedges are weighted, the adjacency matrix of a hypergraph can be written as A = IW I T -D, where I is the incidence matrix, W is the diagonal matrix with the weights of the hyperedges along the diagonal, and D is a diagonal matrix with the degrees of the nodes along the diagonal [START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF].

From the incidence matrix, one can also define the intersection profile of a HOrS as

P = I T I, (2)
which is an m × m matrix, whose elements P αβ count the number of vertices in common between two hyperedges α and β and m is the number of hyperedges (Fig. 3E). The intersection profile is useful in the statistical study of edge intersections in hypergraphs [START_REF] Philip S Chodrow | Configuration models of random hypergraphs and their applications[END_REF]. The same construction also applies to simplicial complexes (Fig. 3F).

The adjacency between two vertices can be defined directly, without any dependence on the definition of an incidence matrix. This approach is often used when the higher-order structures cannot be uniquely identified only by the set of nodes involved, or when there is a theoretical need for a more restrictive notion of adjacency between two hyperedges than just that they intersect in at least two vertices. For example, when studying motifs in a network, for each motif M one can construct a n × n adjacency matrix A M , where n is again the number of nodes, and whose entries a ij are the number of times i and j both belong to an instance of motif M [START_REF] Austin R Benson | Higher-order organization of complex networks[END_REF]. Such adjacency matrix can also be seen as that of a weighted network built only of the instances of M . It can be useful to notice that when M is a d-clique, then A M = A d is the adjacency matrix built from the incidence matrix containing only d-dimensional hyperedges. This same approach can be used to build incidence matrices representing the relationship between the nodes and HOrS (Figs. 3C,D).

The adjacency matrices {A 2 , A 3 , ⋯, A d , ⋯} for each d-dimensional hyperedge in the HOrS represent the weighted networks underlying the HOrS, and can be collected in a natural way in an adjacency tensor of dimension d, indexed by the node labels (Figs. 3G,H). Further insights into the structure of the hypergraphs themselves [START_REF] Juan | On the Laplacian spectrum and walk-regular hypergraphs[END_REF] and into the processes taking place over them [START_REF] Bellaachia | Random walks in hypergraph[END_REF][START_REF] Avin | Radio cover time in hyper-graphs[END_REF] can be obtained from studying the Laplacians of these networks and their spectra, which will be introduced in Sec. III E.

Another reason for building an adjacency tensor without relying on the incidence matrix is practicality. For example, simplicial complexes require to explicitly list all 2 k simplices included in each k-simplex and this can become very impractical. This is due to the constraint on the existence of all subsimplices of any given simplex, which in turn is fundamental for the correct construction of the useful algebraic structures that come with a simplicial complex (e.g. walks and homology, see sections III B and III D 1). To avoid listing all the simplices in a simplicial complex, one could only list the maximal simplices [START_REF] Young | Construction of and efficient sampling from the simplicial configuration model[END_REF], as mentioned in section II. However, while this method effectively compresses the global structure of a simplicial complex, it does not encode the relationships between the k-simplices in the complex and the k + 1 and k -1-simplices, which are exactly the crucial ones to make the simplicial complex representation so useful and unique among the other HOrSs.

In order to avoid this problem, one can define two m k × m k adjacency matrices for each dimension k describing respectively an upper adjacency A U and a lower adjacency A L for all k-simplices. Here, m k is the number of ksimplices. Following standard notation [START_REF] Goldberg | Combinatorial Laplacians of simplicial complexes[END_REF][START_REF] Maletić | Simplicial complexes of networks and their statistical properties[END_REF][START_REF] Duval | Shifted simplicial complexes are Laplacian integral[END_REF][START_REF] Daniel | Higher order degree in simplicial complexes, multi combinatorial Laplacian and applications of TDA to complex networks[END_REF], two k-simplices are lower adjacent if they intersect in a k -1-simplex, they are upper adjacent if they are both faces of the same k + 1-simplex. Then (A k L ) αβ = 1 only if the k-simplices α and β are lower adjacent, while (A k U ) αβ = 1 only if the k-simplices α and β are upper adjacent [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF]. Another way of defining adjacency is to construct a single adjacency matrix A k that isolates lower adjacent interactions that are not involved in upper ones, that is, A k αβ = 1 only if the k-simplices α and β are lower adjacent but not upper adjacent [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF][START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF]. Both these definitions of adjacency will be instrumental in the study of node shortest path centrality defined on paths on k-dimensional simplices (Sec. III B).

It is also possible to define an adjacency matrix which generalizes the standard one used in simple graphs, that is that an element a ij = 1 when the edge {i, j} is present in the graph. To generalize this idea to higher-order interactions, one needs to consider a combinatorial object A indexed by all possible permutations of α. Then, for each order d, one defines an d n × n × ⋅ ⋅ ⋅ × n adjacency tensor A d so that an entry a i1,...,i d = a α represents d-dimensional set of nodes participating in the higher-order interaction α = {i 1 , . . . , i d }. This means that a α = 1 if the set α is present, while a α = 0 otherwise. This definition was originally introduced in [START_REF] Courtney | Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes[END_REF] in the context of ensembles of simplicial complexes (Fig. 3L). However, it can be easily extended to hypergraphs and other set-based HOrS (Fig. 3K).

B. Walks, paths and centrality measures

Network centralities are node-related measures that quantify how "central" a node is in a network. There are many ways in which a node can be considered so: for example, it can be central if it is connected to many other nodes (degree centrality), or relatively to its connectivity to the rest of the network (path based centralities, eigenvector centrality). In the following, we review some of the most common centralities and their possible generalizations to higher orders.

Degree centralities

The simplest centrality measure is the degree of a vertex, which counts how many other vertices are incident to it. The degree can easily be defined from any of the adjacency matrices defined in Sec. III B as

deg(i) = n j=1 a ij . (3)
Via the adjacency tensor introduced in [START_REF] Courtney | Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes[END_REF], one can define a comprehensive generalized degree which incorporates not only the dependecies of nodes to their higher-order counterparts, but also for any intermediate δ < d-dimension. In terms of the adjacency tensor, the generalized degree is defined as

[a,d] [c,d] [c,e] [b,c] [a,b,c] [a,d] [c,d] [c,e] [b,c] a b c d e [a,b,c] [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] [a,b,c] [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] a b c d e [a,b,c] [a,d] [c,d] [c,e] [b,c] a b c d e [a,b,c] [a,d] [c,d] [c,e] [b,c] [a,c] [a,b]
F E J K L [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] [a,d] [c,d] [c,e] [b,c] [a,c]
k d,δ (α) = α a ′ α (4)
and indicates the number of d-dimensional simplices α ′ that are incident on the δ-dimensional simplex α. For δ = 0 the generalized degree reduces to the standard node degree centrality relative to d-simplices. Finally, a coarser way to quantify node degree centrality in simplicial complexes is to just count the number of maximal simplices (or facets) incident on a vertex [START_REF] Patania | The shape of collaborations[END_REF].

When working with weighted hypergraphs, it is slightly trickier to properly define a degree. For example, Kapoor et al. [START_REF] Kapoor | Weighted node degree centrality for hypergraphs[END_REF] illustrate how a node's degree centrality can be defined it terms of either its incident hyperedges or its adjacent nodes, where two nodes are considered adjacent if they belong to the same hyperedge. The degree centrality of a node in a hypergraph becomes then defined as the number of nodes adjacent to it, and the weighted degree centrality as the sum of weights of the ties of the node with the other nodes in the hypergraph.

How to define the weight of a tie is going to be important to identify the meaning of centrality. The weight can be in the tie between two nodes as the number of hyperedges they both belong to, or on the hyperedge itself attached as a function of its multiplicity. Kapoor et al. [START_REF] Kapoor | Weighted node degree centrality for hypergraphs[END_REF] compare degree centralities relative to five different definition of hyperedge weight: constant, frequency based, Newman's strength for collaboration networks, Gao's weights for the email dataset, the probability of a contact between the two nodes over interactions in a group of size k. Degrees in HOrSs can also be defined on hyperedges or simplices. In fact, for each hyperedge or simplex α we can define the deg(α) as the number of hyperedges that are adjacent to α in some of the ways introduced earlier.

In particular, we can define a lower and upper adjacency degree in simplicial complexes [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF][START_REF] Jiang | Spatial topology and its structural analysis based on the concept of simplicial complex[END_REF] as the number of simplices that are either lower or upper adjacent to α, or the number of simplicies that are lower adjacent but not upper adjacent to α. Moreover, these adjacency definitions can be combined as done by Serrano and Gómez in [START_REF] Daniel | Higher order degree in simplicial complexes, multi combinatorial Laplacian and applications of TDA to complex networks[END_REF], where they introduce the maximal simplicial degree deg(α) = deg A (α) + deg U (α), that counts the number of upper adjacent simplices to α and the number of lower adjacent simplices that are not upper adjacent. Degree based centralities can be defined building on any of the above definitions and generalizing on the graph based formulas. The interested reader can find an exhaustive review of centrality measures for HOrSs in [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF][START_REF] Daniel | Centrality measures in simplicial complexes: Applications of TDA to Network Science[END_REF].

Paths and path-based centralities

To define a centrality relative to the entire network, we need to define an acceptable way in which one can traverse a HOrS by defining walks along its connections. A walk in a simple graph is a sequence of vertices [v 1 , v 2 , ⋯, v ] such that two consecutive vertices are v i , v i+1 are adjacent to each other. A walk where a vertex is present only once is called a path.

After having introduced the concept of walks on HOrSs, then centralities can be defined using the classical definitions as either the number of paths that go through node i (betweeness centrality), or the average length of shortest path between a vertex and all vertices in the graph (closeness centrality), the number of closed walks of different lengths starting and ending at the same vertex (subgraph centrality). In the case of HOrSs, when defining paths, it is easier to consider walks connecting two hyperedges (simplices) than walks connecting two vertices. This is because any pair of nodes present in the two extremal hyperedges (simplices) of the path will be connected by exactly the same walk.

The easiest way to define a walk in a hypergraph is as a sequence of hyperedges with at least 1 vertex in common [START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF][START_REF] Lu | High-ordered random walks and generalized Laplacians on hypergraphs[END_REF]. This definition follows from the notion of adjacency induced by the incidence matrix. Then, the subhypergraph centrality of vertex v is the number of closed walks of different lengths in the network starting and ending at vertex v [START_REF] Estrada | Complex networks as hypergraphs[END_REF][START_REF] Estrada | Subgraph centrality and clustering in complex hyper-networks[END_REF], which can be expressed as

C s h(v i ) = vj u 2 ij e λj
where u ij is the ith component of the jth eigenvector of the adjacency matrix. This definition can be generalized to k-walks between hyperedges as a sequence of hyperedges such that each pair of successive hyperedges are adjacent and they intersect in at least k vertices [START_REF] Maletić | Simplicial complexes of networks and their statistical properties[END_REF][START_REF] Sinan G Aksoy | Hypernetwork science via high-order hypergraph walks[END_REF]. This in turn requires that all hyperedges in the walk have dimension s at least s = k + 1, but poses no constraints on their maximum dimension s. Examples of two simple walks for regular hypergraphs, one 1-walk and two different 2-walks, are shown in Fig. 4. The corresponding closeness centrality is then the reciprocal of the average length of the shortest path between the node and all other nodes in the HOrS [START_REF] Sinan G Aksoy | Hypernetwork science via high-order hypergraph walks[END_REF].

The hypergraph definition of a k-walk also applies to simplicial complexes [START_REF] Daniel | Centrality measures in simplicial complexes: Applications of TDA to Network Science[END_REF] and can be used to define other measures of betweeness and closeness centrality. However, in simplicial complexes, it is more appropriate to define a k-walk only comprised of k-simplices that are lower adjacent i.e. have in common k vertices (remember, a k simplex contains (k + 1)vertices) [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF]. Just as before, the simplicial closeness of a k-simplex is then the reciprocal of the sum of its k-shortest path distance to all other k-simplices. The simplicial harmonic closeness centrality of a k-simplex is instead the sum of reciprocal s-shortest path distance to all other k-simplices.

In Fig. 5 we provide examples of how different configurations on k and s can yield different connectivity structures for the same HOrS. If we allow any hyperedge or simplex dimension (s > 1) and any size of the intersection between Visualization of the different definitions of walks on an toy example of higher-order network. From left to right, the definition of the walk gets more restrictive. For each restriction on the defining variable of a walk (what elements are allowed to be considered for a walk and how much do they need to overlap in order to be adjacent)-we color what parts of the HOrS are reachable by at least a walk of length greater than one, and in gray what parts do not allow any walk to pass through them. In (C,D), some parts of the HOrS are connected only if the HOrS is a simplicial complex, and we visualize those with a striped pattern. We can see how the less restrictive walk (A), which can pass through two edges that have at least one vertex in common, yields the same connectivity as its underlying graph. Restricting the intersection between two adjacent edges to have at least 2 vertices in common, example (B), already highlights different mesoscale connectivity patterns in the HOrS, which can be further studied introducing a further restriction on the size of the edges, examples (C) and (D).

them (k > 0), then we find that all paths are valid and the whole toy HOrS is connected. In fact, we recover the simple graph connectedness (Fig. 5A).

If we instead require that interactions share at least two vertices (k > 1), some paths are not allowed. For example, the triangle [START_REF] Barabási | The network takeover[END_REF][START_REF] Latora | Complex Networks: Principles, Methods and Applications[END_REF][START_REF] Holme | Temporal networks[END_REF] is not connected to any of the triangles in the tetrahedron [START_REF] Anderson | More is different[END_REF][START_REF] Barabási | The network takeover[END_REF][START_REF] Albert | Statistical mechanics of complex networks[END_REF][START_REF] Dorogovtsev | Evolution of networks[END_REF], because the only intersection is 2.

Note also at this point that whether the HOrS is a hypergraph or a simplicial complex can make a difference. In Fig. 5C, if we consider the HOrS to be a simplicial complex, the presence of the tetrahedron [START_REF] Anderson | More is different[END_REF][START_REF] Barabási | The network takeover[END_REF][START_REF] Albert | Statistical mechanics of complex networks[END_REF][START_REF] Dorogovtsev | Evolution of networks[END_REF] implies also the presence of all the subfaces. Combining this with the requirement k = 1, this also implies that some paths will not be walkable, e.g. all the triangles inside the tetrahedron share an edge with each other. Hence one cannot walk from one triangle to the other (shown as the black edges). However, there exist other paths that make the HOrS connected, for example, [START_REF] Anderson | More is different[END_REF][START_REF] Barabási | The network takeover[END_REF][START_REF] Dorogovtsev | Evolution of networks[END_REF] is connected to [START_REF] Albert | Statistical mechanics of complex networks[END_REF][START_REF] Dorogovtsev | Evolution of networks[END_REF][START_REF] Newman | The structure and function of complex networks[END_REF]. Similar considerations also apply to Fig. 5D, which shows an example of the simplicial k-walk described earlier in this section, that is, a walk limited to jumps between lower adjacent simplices.

Eigenvector centralities

In some applications, it is important to quantify the influence of a node on the entire network, rather than its centrality relative to possible paths. First introduced in a sociological context by Bonacich [START_REF] Bonacich | Factoring and weighting approaches to status scores and clique identification[END_REF], the eigenvector centrality tries to capture this effect using an iterative definition. In fact, the eigenvector centrality a node depends on the centrality of its neighbours [START_REF] Newman | Modularity and community structure in networks[END_REF]. In the graph case, it can be written as

x v = 1 λ t∼v x t = 1 λ t∈G a vt x t (5)
where x v is the eigen-centrality of node v and a vt the adjacency matrix of the graph. Note that again the generalization to higher order interactions relies only on the definition of connectivity and paths. This measure has become widely used in a variety of situations ranging from Google's PageRank [START_REF] Amy | Deeper inside pagerank[END_REF] to neuron's firing rate [START_REF] Mckay | From structure to activity: Using centrality measures to predict neuronal activity[END_REF]. Interestingly, Bonacich [START_REF] Bonacich | Factoring and weighting approaches to status scores and clique identification[END_REF] also showed that, if association is defined in terms of walks, a family of centralities can be defined based on the length of walk considered. Degree centrality counts walks of length one, while eigenvalue centrality counts walks of length infinity. Alternative definitions of association are also reasonable. Alpha centrality allows vertices to have an external source of influence, while Estrada's subgraph centrality proposes only counting closed paths (triangles, squares, etc) [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF][START_REF] Estrada | Subgraph centrality and clustering in complex hyper-networks[END_REF]. Bonacich [START_REF] Bonacich | Simultaneous group and individual centralities[END_REF] generalized eigenvector centrality to the case of bipartite graphs using their adjacency matrix. A feature of this definition is that one can compute centrality score for the same eigenvalue for both node sets. Using the same technique, one can compute eigenvalue centrality scores from incidence matrices for both hypergraphs, which will give an eigencentrality score for both vertices and hyperedges. A two-mode analysis of an incidence matrix then enables to identify central hyperedges in addition to nodes [START_REF] Bonacich | Hyper-edges and multidimensional centrality[END_REF].

For motifs, it is possible to use the spectral features of the weighted motif adjacency matrix A M defined in III A. For example, the clique motif eigenvector centrality score of node i is given by the ith component of the largest real eigenvector of W [START_REF] Austin R Benson | Three hypergraph eigenvector centralities[END_REF].

To incorporate non-linearities, we can make it so that the contribution of the centralities of two nodes in a 3-node hyperedge is multiplicative for the third. To do so, one can define the centrality using the eigenvector of the tensor A k , where k labels the considered dimensions. There are several other types of tensor eigenvectors [START_REF] Qi | Tensor Analysis: Spectral Theory and Special Tensors[END_REF], and for this reason Benson [START_REF] Austin R Benson | Three hypergraph eigenvector centralities[END_REF] use Z-and H-eigenvectors which are arguably the most well-understood and commonly used tensor eigenvectors. The Z-eigenvector centrality vector is then defined as any positive vector c satisfying

T c m-1 = λc m c 1 = 1 (6)
for some eigenvalue λ > 0 of the adjacency tensor T = A k , and respectively the H-eigenvector centrality vector as the positive real vector c satisfying

T c m-1 = λc m (7)
.

As we have seen before, for hypergraphs and simplicial complexes, adjacency can be defined not only at the vertex level, but also between hyperedges. It is possible to introduce notions of centralities for simplices and hyperedges through the components of the principal eigenvector of A k [START_REF] Estrada | Centralities in simplicial complexes. applications to protein interaction networks[END_REF]. The simplicial eigenvector centrality of the ksimplex α is given by the α component of the principal eigenvector of A k , and its simplicial Katz centrality as

K k,α = [∑ p = 0 ∞ x m A m k ] α where 0 < x < 1 λ1(A k ) .

C. Triadic closure and clustering coefficient

A key concept in network analysis for going beyond node-related measures is triadic closure. It is a concept that comes from sociology [START_REF] Mark | The strength of weak ties[END_REF], which argues that a strong social tie between two persons can only occur if it is part of a triangle. In other terms, my closest friends are the ones I share friends with. In a graph structure, triadic closure is represented as 2-paths of length 2 that are closed by an third edge. The fraction of pairs of neighbouring nodes that are themselves linked by an edge defines the node's clustering coefficient. The clustering coefficient is an important network measure, which informs on the density of a node's neighborhood. This coefficient can also be computed globally as the total percentage of 2-paths that are closed by and edge, i.e. are part of triangles. This concept does not generalize well to bipartite graphs, because triangles -as any other odd cycle -do not exist in bipartite graphs. The global clustering coefficient can however be defined through its one-mode projections, as the number of 4-paths in the bipartite graph that are part of a 6-cycle [START_REF] Opsahl | Triadic closure in two-mode networks: Redefining the global and local clustering coefficients[END_REF][START_REF] Stephen | Network analysis of 2-mode data[END_REF].

Other attempts to generalize the concept of clustering coefficient beyond pairwise relations focused on keeping its close relation to the notion of triadic closure. One possibility is to define a local clustering coefficient from the new definitions of neighborhood that a node can have in a HOrS [START_REF] Alexander P Kartun-Giles | Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks[END_REF]. For example, in a simplicial complex, a neighborhood can also be defined at the maximal simplex level, and can also be defined for higher order simplices, not only for nodes [START_REF] Daniel | Centrality measures in simplicial complexes: Applications of TDA to Network Science[END_REF].

Another possibility is to redefine the notion of paths [START_REF] Estrada | Complex networks as hypergraphs[END_REF] as sequence of vertices (v 1 , . . . , v ) such that two adjacent vertices v i , v i+1 both belong to the same hyperedge e i . Then, the clustering coefficient follows from its pairwise definition as the ratio of 2-paths that are closed by an edge. In a HOrS, paths can also be defined as sequence of k-cliques, or k -1-simplices (e 1 , . . . , e ) such that two adjacent cliques e i , e i+1 have k -1 nodes in common, which we will call k-paths as they are formed of k-cliques. In this case too, the clustering coefficient is then defined as the fraction of k-paths of length k that are part of a k + 1-clique [START_REF] Hao Yin | Local higher-order graph clustering[END_REF].

In simplicial complexes, we can distinguish between a closed k-path of length k + 1 and a k-simplex. Hence, the clustering coefficient can be defined as the ratio of closed k-paths of length k + 1 that are closed by a k-simplex. In particular, when considering triangles, this definition of the clustering coefficient can be used to verify the sociological intuition behind the diadic triadic closure idea [START_REF] Patania | The shape of collaborations[END_REF], that is, it is possible to count how many actual "full" triangles (2-simplices) among the possible "empty" triangles constructed from three edges (a closed path of three 1-simplices). Finally, this higher-order clustering coefficient can be further generalized to motifs in weighted or growing HOrS [START_REF] Austin R Benson | Simplicial closure and higher-order link prediction[END_REF].

D. Simplicial homology

One of the main reasons to use simplicial complexes as representations for higher-order datasets is a new algebraic toolset that studies the topology of the HOrS in a unique way: simplicial homology. Homology is an algebraic topological concept that enables us to study the structure of a simplicial complex at different dimensional scales. Before we can introduce homology, we need to define an algebraic structure on our simplicial complex. This requires imposing an orientation for each simplex in the complex, formalized as the ordering of the vertices. The orientation can be arbitrarily chosen, just like the choice of node labels in a network, and it is only needed in order to coherently perform the computations. An orientations is an equivalence class on the vertex orderings, where two orderings are equivalent if they differ by an even permutation [START_REF] Hatcherr | Algebraic topology[END_REF][START_REF] Edelsbrunner | A Short Course in Computational Geometry and Topology[END_REF]. The orientation issue does not exist in a 0-simplex, since the nodes are not oriented, and only arises when we deal with higher order graphs. For simplicity, and with no loss of generality, we choose the orientation induced by the ordering of the vertex labels.

Boundary operators and homology groups

We can combine these oriented simplices in k-dimensional chains c = r 1 σ 1 + r 2 σ 2 + ⋯ where σ i are k-dimensional simplices and r i ∈ F are coefficients in a field F. The collection of all possible k-chains in X is the vector space

C k = {r 1 σ 1 + r 2 σ 2 + ... r i ∈ F, σ i ∈ X k } where X k is the set of k-simplices in X.
We can also define the dual space of C k , denoted as the co-chain space, C k as the linear space of all alternating functions f ∶ C k → R. Chain and co-chain space are just two sides of the same coin, as they encode the same information. For instance, C 1 can be interpreted as the space of edge-flow vectors and each of its elements f assigns a scalar to an edge, representing the intensity of flow along that edge with a sign which represent the agreement or not with the chosen orientation of the edge.

We can relate the k-chain space C k to the k -1 using the boundary operator, which maps each k-simplex to its

k -1-dimensional faces ∂ k ∶ C k → C k-1 . When applied on a simplex α = [v 0 , ..., v k ], it gives: ∂ k ([v 0 , ..., v k ]) = k i=0 (-1) i [v 0 , ...v i-1 , v i+1 , ..., v k ]. (8)
Basically, in each term of the linear combination, we remove a vertex from the original simplex. In this way, we obtain its boundary as an alternate sum of the k -1-order simplices. In a triangle [v 0 , v 1 , v 2 ], for instance, we get the alternate sum of the three edges

([v 1 , v 2 ] -[v 0 , v 2 ] + [v 0 , v 1 ]
). The image of the boundary map, im(∂ k ), coincides with the space of (k -1)-boundaries. The kernel ker(∂ k ) is instead the space of k-cycles, as it is easy to prove that for every cyclic chain c whose starting point coincides with the ending point

∂ k c = 0. Moreover, ∂ k ○ ∂ k+1 = 0, which implies that im(∂ k+1 ) ⊆ ker(∂ k ).
The elements of ker(∂ k ) which are not included in im(∂ k+1 ) can be denoted with the quotient space

H k ≡ ker(∂ k ) im(∂ k+1 ) (9)
which takes the name of k-th homology group. The elements of H k correspond to the k-cycles that are not induced by a k-boundary, namely the k-dimensional holes of our complex [START_REF] Hatcherr | Algebraic topology[END_REF][START_REF] Edelsbrunner | A Short Course in Computational Geometry and Topology[END_REF]. The dimension of the homology group H k is called the k-th Betti number and it represents a way to classify the k-dimensional topology of a HOrS. Specifically, the 0th Betti number represents the number of connected component in the simplicial complex, the 1st Betti number is the number of cycles, the 2nd the number of voids enclosed by 2-dimensional simplices, 3rd the number of 4-dimensional voids etc.

Evolving simplicial complexes

Homology is an century old concept in algebra and is one the key tools for the study and classification of shapes in mathematics [START_REF] Edelsbrunner | A Short Course in Computational Geometry and Topology[END_REF]. Recently the concept has been extended to weighted and growing simplicial complexes [START_REF] Ghrist | Barcodes: The persistent topology of data[END_REF].

Inspired by 90s shape theory [START_REF] Verri | On the use of size functions for shape analysis[END_REF], in the early 2000s persistent homology was invented in different research groups around the globe [START_REF] Carlsson | Topology and data[END_REF][START_REF] Cagliari | Size functions from a categorical viewpoint[END_REF][START_REF] Edelsbrunner | Topological persistence and simplification[END_REF] giving birth to the field of Topological Data Analysis [START_REF] Patania | Topological analysis of data[END_REF]. Persistent homology is a way of computing the homology of a growing simplicial complex and to follow how its homological features evolve along the filtration [START_REF] Zomorodian | Computing persistent homology[END_REF]. The filtration is a sequence of simplicial complexes that provide progressively finer approximations of the data space under investigation. The persistence of certain homological features through the multiple scales explored in the filtration is related to their relevance for the data space, with the typical assumption that more persistent features are more important, although the exact interpretation of the persistence of a homological feature depends crucially on how the filtration is constructed (see for example [START_REF] Feng | Persistent homology of geospatial data: A case study with voting[END_REF]). In the last 20 years the field has been vastly developed, and new methods for tracking homological features have been introduced for cases when simplicial complexes can also lose simplices along the filtration, zig-zag homology [START_REF] Carlsson | Zigzag persistence[END_REF], or for when the growth of the simplicial complex can be described through more than one parameter multi-persistent homology [START_REF] Carlsson | The theory of multidimensional persistence[END_REF]. The interested reader can find a good introduction to the theory and practice of persistent homology in [START_REF] Edelsbrunner | Persistent homology[END_REF] and [START_REF] Otter | A roadmap for the computation of persistent homology[END_REF]. A large fraction of the work no HOrSs in real datasets requires some version of persistent homology. In section IX we provide some examples of its use

Other measures of shape in simplicial complexes

Homology in all its variants (persistence, zigzag, multiparameter) is a powerful tool to classify structure according to key mesoscale features. However, it is important to notice that it depends on the choice of coefficient field F used to compute the homology. Moreover, homological invariants are not exhaustive in general, as they pertain to homological equivalence classes, thus they compress some information away. This is rooted in the invariance of topological properteis to deformations, the classical example being the topological equivalence between a mug and a donut. Indeed, there are no complete topological classification known, and one can find examples of simplicial complexes homologically indistinguishable from a 3-sphere (a sphere in 4-dimensions) that are not spheres at all [START_REF] Mr Muldoon | Topology from time series[END_REF]. Nonetheless, the homological invariants give unique insights in the dynamics that can exist in data spaces and as mentioned above have found widespread application (see Sec. IX for relevant examples).

In addition to the full homological description, other invariants have been used in applications [START_REF] Robert | Estimating thresholding levels for random fields via Euler characteristics[END_REF][START_REF] Pranav | Topology and geometry of Gaussian random fields I: On Betti numbers, Euler characteristic, and Minkowski functionals[END_REF]. Two commonly used ones are the Euler characteristic and the Laplacian spectral entropy.

For any simplicial complex Σ, the Euler characteristic is defined as the alternating sum χ = ∑ D k=0 (-1) k f k , where f k is the number of simplices of dimension k present in the simplicial complex, and D is the maximal dimension of a simplex in Σ [START_REF] Mr Muldoon | Topology from time series[END_REF].

The spectral entropy, first introduced by [START_REF] Maletić | Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks[END_REF] for simplicial complexes, provides a measure of the degree of the overlap between simplices in the complex via the study of the eigenvalues of the L k combinatorial laplacian. The spectral entropy is then

H k = - 1 log(f k ) f k i=1 p(λ i k ) log P (λ i k ) (10)
where p(λ i k ) =

λ i k ∑ i λ i k
is the contribution of the eigenvalue λ i k to the eigenspectrum of the kth combinatorial laplacian L k , and f k the number of simplices of dimension k present in the simplicial complex. The most general framework for not k-uniform hypergraphs requires a deeper analysis and the problem of generalizing a Laplacian for these structures has been addressed by many scientists [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF][START_REF] Goldberg | Combinatorial Laplacians of simplicial complexes[END_REF][START_REF] Lim | Hodge Laplacians on graphs[END_REF][START_REF] Parzanchevski | Simplicial complexes: Spectrum, homology and random walks[END_REF][START_REF] Michael T Schaub | Random walks on simplicial complexes and the normalized Hodge Laplacian[END_REF].

E. Higher-order Laplacian operators

The Laplacian is an operator that plays a key role in information processing of relational data, and has analogies with the Laplacian in differential geometry. Similarly to the adjacency matrix, there is no unique way to generalize the Laplacian to HOrSs. However, as networks can be thought of as a special subset of the larger family of HOrSs, the graph Laplacian is a special case belonging to the more general family of Hodge Laplacians. The intuition here in the construction of higher order Laplacians, either for hypergraphs or for simplicial complexes, is that the role played by the nodes in the graph Laplacian is, at higher orders, played by links, triangles, tetrahedra and higher dimension analogues.

In analogy with the standard construction in graphs, a straighforward way to introduce a higher order Laplacian is to define a Laplacian matrix L from one of the adjacency matrices introduced in Sec. III A. We can thus write:

L = D -A ( 11
)
where A is the chosen adjacency matrix, and D is the diagonal matrix with the degree sequence of the nodes along the diagonal [START_REF] Rodriguez | Laplacian eigenvalues and partition problems in hypergraphs[END_REF][START_REF] Chung | The Laplacian of a hypergraph[END_REF]. However, this approach yields a matrix L that is equivalent to the Laplacian of the weighted graph associated to the adjacency matrix A [START_REF] Saito | Hypergraph p-Laplacian: A differential geometry view[END_REF].

The graph Laplacian can be interpreted as a particular case of the discrete Laplace operator representing the flux density of the gradient flow of a function defined on the vertices of a graph. For hypergraphs and simplicial complexes, because of their richer structure, there are multiple ways one can define Laplacians that are compatible with the corresponding differential geometry operator. In particular, for k-uniform hypergraphs and k-regular simplicial complexes we can define a unique adjacency tensor A k that represents the HOrS. Then, one introduces a Laplacian tensor which is the discretization of the higher order Laplace-Beltrami operator in differential geometry [START_REF] Cooper | Spectra of uniform hypergraphs[END_REF][START_REF] Hu | The Laplacian of a uniform hypergraph[END_REF].

This theoretical connection to the continuous operator opens the possibility to use the spectrum of this tensor to study the diffusion properties of the HOrS. For example, in recent years, many authors have defined a Laplacian operator on hypergraphs for specific diffusion processes [START_REF] Louis | Hypergraph Markov operators, eigenvalues and approximation algorithms[END_REF][START_REF] Hubert Chan | Spectral properties of hypergraph Laplacian and approximation algorithms[END_REF][START_REF] Hubert | Generalizing the hypergraph Laplacian via a diffusion process with mediators[END_REF][START_REF] Li | Submodular hypergraphs: P-Laplacians, Cheeger inequalities and spectral clustering[END_REF]. Another higher-order Laplacian, designed in the context of synchronization in systems with higher-order interactions between oscillators places on the nodes, and introduced in Ref. [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF], is discussed in Sec. VI A. In the following subsections we provide explicit definitions for Laplacian operators on hypergraphs and simplicial complexes. In Sec. V instead we discuss in details their mathematical properties and their link to diffusion.

Hypergraph Laplacians

Historically, the first attempt to generalize the Laplacian operator to hypergraphs along these lines is due to Chung [START_REF] Chung | The Laplacian of a hypergraph[END_REF], who considered a simplified type of hypergraphs, the s-uniform hypergraphs, where all the hyperedges have the same size s. Given an s-uniform hypergraph H with N nodes and edge set E, for each (s-1)-subset of nodes, x, we can define the degree d(x) as the number of edges involving vertices in x, and the diagonal matrix D such that D(x, x) = d(x). The adjacency matrix A used in this case is a binary matrix such that A(x, y) = 1 if subsets x and y are connected (s -1)-subsets that share s -2 nodes. Formally, that corresponds to A(x, y) = 1 if x = [x 1 , x 2 , ..., x s-1 ] and y = [y 1 , x 2 , ..., x s-1 ] and x ∪ y ∈ E, and 0 otherwise. The Laplacian can then be defined as:

L = D -A + ρ(K + (s -1)I) (12)
where ρ = d N , d is the average degree, and K is the matrix of the complete graph, such that K(x, y) = 1 if x = [x 1 , x 2 , ..., x s-1 ] and y = [y 1 , x 2 , ..., x s-1 ], and 0 otherwise. Another possibility to define a hypergraph Laplacian is to derive the Laplacian from the transition matrix of a random walk. For instance, Lu and Peng [START_REF] Lu | High-ordered random walks and generalized Laplacians on hypergraphs[END_REF] considered random k-walks (k < s) on s-uniform hypergraphs. These are k-walks generated as follows (Fig. 4). The walker starts from the sequence of k visited vertices at the initial step x 0 edge. At each time step, let S be the set of last s vertices in the sequence of visited vertices in the hypergraph H = (V, E). A random (s -k)-set T is chosen from the neighborhood Γ(S) of S uniformly; here Γ(S) is given by {T S ∩ T = ∅ and S ∪ T ∈ E(H)}; the vertices in T are added into the sequence one by one in an arbitrary order. The definition of Laplacian is split in two cases:

• For 1 ≤ k ≤ s 2 the k-th Laplacian is defined as the Laplacian of a weighted undirected graph G (k) built such that a random k-walk on H is essentially a random walk on G (k) .

• For s 2 ≤ k ≤ s -1 the k-th Laplacian is defined as the Laplacian of an Eulerian directed graph D (k) and the random k-walk on H is in one-to-one correspondence to the random walk on D (k) .

Lu and Peng [START_REF] Lu | High-ordered random walks and generalized Laplacians on hypergraphs[END_REF] also introduced α-lazy random k-walks, with 0 ≤ α ≤ 1, which are modified random k-walks where with probability α the walker stays at the current edge and with probability 1 -α it moves by appending sk vertices to the sequence.

Combinatorial Laplacians

For general simplicial complexes, a higher-order Laplacian can be defined for each dimension k via two matrices that encode respectively the roles of upper and lower adjacencies in dimension k:

L k = L k U + L k L ( 13
)
where L k U and L k L are called the upper and lower adjacency Laplacians. The full Laplacian L k is usually referred to as combinatorial, and each k-order Laplacian encodes the relationships of k-simplices with their adjacent (k + 1)-(upper adjacency) and (k -1)-simplices (lower adjacency).

C B a b c d e [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] -1 -1 -1 -1 -1 1 1 1 1 1 1 -1 a b c d e [a,b,c] 1 1 -1 B 1 B 2 D -1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 -1 = 3 -1 -1 2 4 -1 -1 2 -1 -1 -1 -1 -1 1 -1 -1 -1 a b c d e a b c d e B 1 B 1 B T = L 0 = 3 -1 -1 -1 1 2 [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] 1 3 -1 -1 -1 1 3 -1 1 1 2 2 1 -1 1 1 [a,d] [c,d] [c,e] [b,c] [a,c] [a,b] L 1 = B 1 B T B 2 B 2 B T = + B 1 D E F L 2 = B 2 B 2 B T 3 =
Laplacians FIG. 6. Construction of combinatorial Laplacian. The first step required to define boundary operators is to endow a simplicial complex with an orientation. Here we choose to orient our toy simplicial complex with a simple lexicographic orientation (A). Once the orientation is fixed, it is possible to define boundary matrices; since there are only simplices with order ≤ 2, we have two non trivial boundary matrices B1 (B) and B2 (C). Following Eq. ( 15), we can build the combinatorial Laplacians corresponding to the three different dimensions of simplices in the simplicial complex: L0 defined on nodes, and identical to the standard graph Laplacian (D); L1 defined on the edges (E); and L2 which is a scalar in this case because the simplicial complex contains only one 2-simplex (F).

The link between L k and the simplices of dimension k with those of dimension k + 1 and k -1 can be readily understood from the definition of L k U L . The linear boundary operators ∂ k described in Sec. III D 1 can be represented as a matrix B k , whose columns represent all the k-dimensional simplices in the complex, and the rows the (k -1)dimensional simplices. Element β, α of B k , (B k ) βα , is non-zero if the k -1-simplex β is a face of k-simplex α, and can be +1 or -1 according to the orientation induced on β by α, that is the coefficient that β has in the alternating sum ∂ k (α). For each boundary operator, there exists also a co-boundary operator ∂ * k ∶ C k → C k+1 , that is, the adjoint of the boundary operator. In matricial form, this can be represented by the transpose conjugate matrix of B k , B T k . These boundary matrices define L k U and L k L as:

L k U = B k+1 * B T k+1 L k L = B T k * B k (14)
The higher-order combinatorial Laplacian L k becomes then:

L k = B T k * B k + B k+1 * B T k+1 (15)
Figure 6 shows the explicit construction of the combinatorial Laplacian for the simplicial complex in Fig. 3. We first need to choose an orientation for the simplices in the simplicial complex. Here for simplicity we choose the orientation to follow the lexicographic ordering on the nodes' labels (Fig. 6A). Once fixed this, it is possible to compute the two boundary matrices that we need in this case B 1 and B 2 , corresponding respectively to the the boundary matrix mapping chains of edges into chains of nodes (Fig. 6B), and to the boundary matrix mapping chains of triangles into chains of edges (Fig. 6C). We can then easily compute the corresponding combinatorial Laplacians from Eq. ( 15), obtaining the matrices in Figs. 6D-F. Note that for L 0 and L 2 there is only one contribution to the sum, because the simplicial complex does not contain k-simplices of order k respectively less than 0 and larger than 1, hence one of the two terms in the sum vanishes.

Since L k U L describe the relatedness between upper and lower adjacent simplices, they should be related to the upper and lower adjacency matrices A k U L described in section III A 2. It is possible to rewrite L k as [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF]:

L k = D k U -A k U + (k + 1)I n k + A k L ( 16
)
where D k U is a diagonal matrix with on the upper degree of simplices computed from A k U , and n k is the number of k-simplices. Setting k = 0, one recovers standard graph Laplacian of Eq. 12. In terms of boundary operators, it is easy to see also how the combinatorial Laplacian is related to the Hasse Diagram (see Sec. II) of the Simplicial complex. The first term on the rhs of Eq. ( 15) corresponds to moving from k-simplices down to (k -1)-simplices and then back up to k-simplices, while the second term does the opposite, first up to (k + 1)-simplices and then back down to k-simplices.

The Laplacian is a crucial operator in the definition of diffusion processes on simplicial complexes [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF][START_REF] Maletić | Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks[END_REF] which will be discussed thoroughly in Sec. V. In particular, following from the Combinatorial Hodge theorem [START_REF] Hatcherr | Algebraic topology[END_REF], the combinatorial Laplacian decomposes the k-chain space C k into three subspaces:

C k = im(B d ) ⊕ ker(L k ) ⊕ im(B T d+1
),. These three subspaces represent the globally acyclic, the cyclic and locally acyclic components of the flow defined on the combinatorial structure [START_REF] Maletić | Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks[END_REF], which can be used to decompose and study the evolution of dynamical processes on simplicial complexes [START_REF] Michael | Flow smoothing and denoising: Graph signal processing in the edge-space[END_REF]. Another interesting consequence comes from the fact that the kernel of the Laplacian ker(L k ) = ker(B T d ) ∩ ker(B d+1 ) is isomorphic to the k-homology group H k . This in turn implies that the number of (homological) k-holes is the same as the dimension of the kernel of L k , establishing a direct link between the homological and spectral representations of a complex's topology. We leave to the interested reader to check that L 1 in Fig. 6E has indeed a one-dimensional kernel corresponding to the one-dimensional hole in the simplicial complex in Fig. 6A. Finally, we list a few additional spectral properties of L k , which can be easily checked considering subcomplexes of the toy complex in Fig. 6A: • If the simplicial complex consists of disconnected simplicial complexes, then the spectrum of L k is equal to the union of spectra of each component's k-th Laplacian.

• If the simplicial complex is formed by gluing two simplicial complexes along a k-face, then the spectrum is the union of the two spectra.

• If the simplicial complex only consists of one simplex of dimension q, then the Laplacian spectrum only has one eigenvalue, µ = q with multiplicity q! [(q -1 -k)!(k + 1)!] [START_REF] Maletić | Combinatorial Laplacian and entropy of simplicial complexes associated with complex networks[END_REF].

IV. MODELS

Models of HOrSs aim to reproduce, explain, and predict the structure of systems best described with interactions that involve two or more elements of the systems. To allow for variability in their outputs, these models are often specified as collections of random rules, i.e., as stochastic processes. Hence, they define implicit or explicit distributions over sets of HOrSs. In what follows, we review a great many models of models for such HOrSs.

To better delineate the similarities and differences between models, we have organized them in two broad categories based on the type of stochastic process used. In the first subsection (Sec. IV A), we review equilibrium models defined as static distributions over HOrSs. In the second subsection (Sec. IV B), we review out-of-equilibrium models, given as sequences of distributions over HOrSs. Although the separation is not formally perfect (sequences sometimes converge to equilibrium distributions), these models tend to be quite different in practice, which makes this classification a natural one. Our choice is motivated also by the fact that the philosophy underlying these models are somewhat at odd [START_REF] Anthony Cc Coolen | Generating Random Networks and Graphs[END_REF]. On the one hand, equilibrium models are usually simple and straightforward to analyze; they typically make use of independence assumptions, which leads to distributions over HOrSs that can be written down analytically. They are therefore well suited to making statistical inference and to acting as substrate for dynamical processes taking place on HOrSs. On the other hand, out-of-equilibrium models typically lead to complicated outcomes despite their simple specifications; this makes them ideal for explaining how the qualitative properties of real systems can emerge from simple rules. We note, however, that this classification can sometimes be superficial, especially when there are formal correspondence between equilibrium and growing formulation of models [START_REF] Krioukov | Duality between equilibrium and growing networks[END_REF].

Under these two principal headings, we have also organized models by the representation in which they are expressed (see Sec. II for an overview). We have found this separation useful because different threads of the literature have historically favored a single representation, such that models given in the same representation tend to both rest on similar assumptions, and have similar modeling objectives. At the same time, we recognize that from a strictly mathematical point of view, the choice of representation is again superficial due to the formal correspondence between HOrS representations [START_REF] Sinan G Aksoy | Hypernetwork science via high-order hypergraph walks[END_REF]. Hence, we highlight formal equivalence whenever they exist.

On a final introductory note, we have limited the scope of this review by focusing on models where higher-order interactions appear as "first-class citizen." As a result, we have excluded network models that happen to generate higher-order interactions as a byproduct, such as models of non-trivial clustering [START_REF] Bianconi | Number of loops of size h in growing scale-free networks[END_REF][START_REF] Bianconi | Loops of any size and hamilton cycles in random scale-free networks[END_REF][START_REF] Serrano | Tuning clustering in random networks with arbitrary degree distributions[END_REF] or cliques [START_REF] Bollobás | Cliques in random graphs[END_REF][START_REF] Bianconi | Emergence of large cliques in random scale-free networks[END_REF] in networks.

A. Equilibrium models

Bipartite models

We begin our review of equilibrium models with the bipartite configuration model (bipartite CM). It is perhaps the best-known example of an equilibrium model described in the bipartite network representation. The bipartite CM generates HOrSs where both the size of the interactions and the number of interactions per element can be controlled, allowing one to investigate the impact of these quantities on the higher-order structure.

There are a number of variations on the theme of the bipartite CM [START_REF] Bailey K Fosdick | Configuring random graph models with fixed degree sequences[END_REF]. In general, it is defined as some form of maximally random distribution over all bipartite networks that have a fixed degree sequence or distribution (either on average or exactly). For example, in one the version of the model, the degrees are fixed exactly: one provides two sequences of degrees k (A) = (k

(A) 1 , ...k (A) m ) and k (B) = (k (B) 1 , ...k (B)
m ), one for the m nodes in set A and one for the n nodes in set B, but all the other properties are randomized. The probability of a bipartite graph G, according to this model, is thus

P (G) = 1 Ω(k (A) , k (B) ) (17)
for all bipartite networks G in the set Ω(k (A) , k (B) ) of bipartite networks with these degree sequences, and it is 0 for networks outside of this set. This version is sometimes called the microcanonical bipartite CM, or bipartite CM with hard constraints [START_REF] Anthony Cc Coolen | Generating Random Networks and Graphs[END_REF]. The canonical (or soft constraint) version of the model only fixes the expected degree of nodes [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF]; see Fosdick et al. [START_REF] Bailey K Fosdick | Configuring random graph models with fixed degree sequences[END_REF] for a rigorous discussion of the various versions of the model. Early references to the bipartite configuration model first appeared in ecology [START_REF] Diamond | Assembly of species communities[END_REF][START_REF] Edward | The assembly of species communities: Chance or competition?[END_REF]. Mathematically equivalent objects-contingency table with fixed row and column sums-were also studied in statistics around the same time [START_REF] Gail | Counting the number of r× c contingency tables with fixed margins[END_REF][START_REF] Verbeek | A survey of algorithms for exact distributions of test statistics in r× c contingency tables with fixed margins[END_REF]. Network science and physics innovations in this area have included thus far: the use of probability generating function to calculate properties of the model [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF]; the introduction of statistical mechanics tools (grandcanonical ensembles) to analyze the model [START_REF] Saracco | Randomizing bipartite networks: The case of the World Trade Web[END_REF][START_REF] Payrató-Borràs | Breaking the spell of nestedness: The entropic origin of nestedness in mutualistic systems[END_REF]; hidden variable formalisms [START_REF] Kitsak | Hidden variables in bipartite networks[END_REF]; and the addition of fixed degree-degree correlations to the model [START_REF] Asma | Generating bipartite networks with a prescribed joint degree distribution[END_REF]. Direct generalizations of the bipartite configuration model have also been proposed, focusing on networks that have more than two "parts." Although it is typically not their explicit goal, these generalizations allow one to model k -1 simultaneous types of higher-order interactions, where k is the number of parts [START_REF] Söderberg | General formalism for inhomogeneous random graphs[END_REF][START_REF] Allard | Heterogeneous bond percolation on multitype networks with an application to epidemic dynamics[END_REF] (see also Boccaletti et al. [13] for a review). They collapse back to the bipartite case when k = 2.

The bipartite configuration model offers a paradigmatic example of how models of HOrSs are used to test hypotheses, via a technique known as "null modeling." The general idea behind null modeling is to generate maximally random HOrSs with a few fixed properties matching that of an observed empirical system. If one observes that some other unrelated properties are systematically reproduced in the randomized ensemble, then these properties are, in a way, "explained" by the fixed properties. Hence, null modeling can help identify connections between the property of HOrSs in empirical studies.

In the context of the bipartite CM, the fixed property is the degree sequence of the two node sets. By applying this technique to bipartite networks of species co-occurrences, for example, it has been shown that the "number of sites per species" and the "number of species per sites" determine the structure, so much so that one cannot conclude on whether natural assembly rules drive the network formation [START_REF] Diamond | Assembly of species communities[END_REF][START_REF] Edward | The assembly of species communities: Chance or competition?[END_REF]. Similar conclusions have been reached with the same method for bipartite networks of plant and pollinators species [START_REF] Payrató-Borràs | Breaking the spell of nestedness: The entropic origin of nestedness in mutualistic systems[END_REF]. A variation on the bipartite configuration model has also been shown to reproduce most of the properties of a network of questions and tags built from the stackoverflow knowledge database, again showing that degrees can "explain" many network properties [START_REF] Fu | Modeling and analysis of tagging networks in stack exchange communities[END_REF]. We note, however, that slightly changing the model can alter the conclusions of network significance analyses a great deal [START_REF] Philip S Chodrow | Configuration models of random hypergraphs and their applications[END_REF][START_REF] Bailey K Fosdick | Configuring random graph models with fixed degree sequences[END_REF]-one should carefully consider the modeling assumptions.

The bipartite CM is a special case of a much more general set of random models, known as exponential random graphs model (ERGM), or logit models [START_REF] Wasserman | Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp[END_REF]. These models aim to generate networks in which one controls the relative frequency of arbitrary small subgraphs (motifs). As we have seen in Sec. II, these motifs can be used to encode higher-order interactions explicitly-and indeed we discuss versions of the ERGM that use motifs for this explicit purpose in Sec. IV A 2 below. For now, however, we only focus on those versions of the ERGM that add motifs within the framework of bipartite networks. In other words, we focus on ERGMs that encode higher-order interactions with two node sets, but that also use bipartite motifs to generate a richer distribution over HOrSs.

Formally, one defines a bipartite ERGM by choosing Q µ (G), the number of times that motif µ = 1, ..., K occurs in G. In the context of bipartite graphs, Q 1 could refer to the number of isolated pairs of nodes, Q 2 to the number of paths of length four, and so on. The choice of motif set is, to a large extent, arbitrary, although it is usually influenced by sampling and identifiability considerations [START_REF] Tom Ab Snijders | New specifications for exponential random graph models[END_REF]. An ERGM then assigns the probability

P (G Q, λ) = 1 Z(λ) e ∑ µ λµQµ(G) Z(λ) = G e ∑ µ λµQµ(G) (18)
to the bipartite network G, where λ = (λ 1 , ..., λ K ) is a set of parameters that control the expected number of motifs of each type in G.

It is in the unipartite network context that exponential random graphs first appeared [START_REF] Frank | Markov graphs[END_REF][START_REF] Paul | An exponential family of probability distributions for directed graphs[END_REF] (see our discussion below in Sec. IV A 2). That said, there have since been quite a few explicit treatments of the bipartite case, coming mainly from social network literature where bipartite networks are known as "two-mode data" [START_REF] Latapy | Basic notions for the analysis of large two-mode networks[END_REF]. A few early models made use of small collections of local motifs, including a model that fixes the number of connected pairs (with one node of each type at the ends) and the number of "two-stars" (number of times the pattern v 1 -w 1 -v 2 is found, where v i is a node in part A and w j is a node in part B) [START_REF] Iacobucci | Social networks with two sets of actors[END_REF][START_REF] Skvoretz | Logit models for affiliation networks[END_REF]. More complicated models controlling the distribution of short paths [START_REF] Robins | Small worlds among interlocking directors: Network structure and distance in bipartite graphs[END_REF] or that add annotations [START_REF] Agneessens | Choices of theatre events: P* models for affiliation networks with attributes[END_REF] soon followed.

It was eventually realized that sampling from ERGMs (both in the bipartite and the unipartite network context) could be extremely challenging due to a degeneracy problem [START_REF] Strauss | On a general class of models for interaction[END_REF][START_REF] Mark | Statistical models for social networks: Inference and degeneracy[END_REF], where the model place a high weight on empty and fully connected networks only. This realization prompted the development of subtle physics-inspired sampling methods for specific ERGMs specifications [START_REF] Fischer | Sampling motif-constrained ensembles of networks[END_REF], and of entirely new specifications for the unipartite model [START_REF] Tom Ab Snijders | New specifications for exponential random graph models[END_REF]. Analogs to the new specifications were also proposed [START_REF] Wang | Exponential random graph (p*) models for affiliation networks[END_REF][START_REF] Wang | Exponential random graph model specifications for bipartite networks-A dependence hierarchy[END_REF] for the bipartite model, leading to improved inference.

Notwithstanding these problems, ERGMs have found many inferential applications. One popular use-case is generating typical network instances that match a set of motif counts Q obtained via empirical surveys [START_REF] Robins | An introduction to exponential random graph (p*) models for social networks[END_REF][START_REF] Jeffrey | Macrostructure from microstructure: Generating whole systems from ego networks[END_REF]. Bipartite networks generated in this way have been used to quantify the significance of specific patterns of interactions found in political networks in the US [START_REF] Jasny | Baseline models for two-mode social network data[END_REF], and in Russia during Brezhnevs era [START_REF] Faust | Scaling and statistical models for affiliation networks: Patterns of participation among Soviet politicians during the Brezhnev era[END_REF]. Another popular use-case of ERGMs is to "invert the direction" of inference and consider P (G Q, λ) as a likelihood that can be used to deduce λ from a fully observed network G with counts Q [START_REF] Wang | Exponential random graph (p*) models for affiliation networks[END_REF]. These parameters can then inform us about the presence and strength of structural effects in the network data [START_REF] Robins | An introduction to exponential random graph (p*) models for social networks[END_REF]. It should be noted, however, that the inference is not necessarily robust since the problems facing ERGMs, like degeneracy, can also affect inference [START_REF] Tom | Markov chain Monte Carlo estimation of exponential random graph models[END_REF]. Additionally, it has been recently argued that if we consider-as we probably ought to-that network data we have are usually sub-samples of a larger underlying network, then ERGMs can lead to misleading inferences [START_REF] Cosma | Consistency under sampling of exponential random graph models[END_REF][START_REF] Crane | Probabilistic Foundations of Statistical Network Analysis[END_REF].

The two sets of models above-bipartite CMs and ERGMs-reproduce local features like the number of the neighbor of a node or the number of short loops. A different set of equilibrium models that instead focus on reproducing their mesoscale features [START_REF] Young | Universality of the stochastic block model[END_REF]. These models control the frequency and organization of large patterns of connections involving many of, but not all of, the nodes in a network [START_REF] Newman | Communities, modules and large-scale structure in networks[END_REF]. Examples include disjoint communities of nodes, disassortatively mixing groups [START_REF] Newman | Mixing patterns in networks[END_REF], and separations in a core and a periphery [START_REF] Stephen | Models of core/periphery structures[END_REF].

These models are most often formulated as extensions of the well-known stochastic block model (SBM) [START_REF] Holland | Stochastic blockmodels: First steps[END_REF] to the bipartite case [START_REF] Doreian | Generalized blockmodeling of two-mode network data[END_REF][START_REF] Rohe | Co-clustering directed graphs to discover asymmetries and directional communities[END_REF]. The general idea is to split the node into two sets of K A and K B "blocks"-one set for each part of the network-and to then connect the nodes randomly, with probabilities ω that depend on their respective blocks.

One simple instantiation of this idea goes as follows [START_REF] Daniel B Larremore | Efficiently inferring community structure in bipartite networks[END_REF]. We denote by g (A) = (g

(A) 1 , ..., g (A)
m ) and g (A) = (g

(B) 1 , ..., g (B)
n ) the blocks of the nodes in each part (where g (A) i = means that node i of part A belongs to block ∈ {1, ..., K A }). We then write the probability of a particular graph G with incidence matrix B = [b ij ] as

P (G ω, g (A) , g (B) ) = i∈A j∈B (1 -ω g (A) i g (B) j ) 1-bij (ω g (A) i g (B) j ) bij , (19)
meaning that an edge is placed between i and j with probability ω g (A)

i g (B) j

. By varying the connection probably matrix ω and the blocks, one can generate networks with arbitrary mesoscopic structure, ultimately approximating all systems to arbitrary accuracy [START_REF] Sofia | Network histograms and universality of blockmodel approximation[END_REF]. Equation [START_REF] Atkin | Mathematical Structure in Human Affairs[END_REF] refers to a canonical or soft constraint bipartite SBM since the number of neighbors of a node is fixed only on average by ω and the blocks. Like the bipartite CM, the bipartite SBM, too, comes in many variants. One can define a microcanonical version along the same lines [START_REF] Tiago | Entropy of stochastic blockmodel ensembles[END_REF], for example. Another variant considers that edges have distinguishable types, e.g., in a user-movie bipartite network where edges represent ratings on a fixed scale [START_REF] Guimerà | Predicting human preferences using the block structure of complex social networks[END_REF]. Yet another variant jointly models the degree sequence and the mesoscopic structure, leading to a so-called degree-corrected bipartite SBM [START_REF] Ball | Efficient and principled method for detecting communities in networks[END_REF] that, unlike the classical degree-corrected SBM, makes explicit the assumptions that there are two node types [START_REF] Rohe | Co-clustering directed graphs to discover asymmetries and directional communities[END_REF][START_REF] Daniel B Larremore | Efficiently inferring community structure in bipartite networks[END_REF][START_REF] Hric | Network structure, metadata, and the prediction of missing nodes and annotations[END_REF] (Fig. 7A). Finally, it is also possible to introduce a hierarchy, with blocks that are themselves grouped into larger blocks, and so on [START_REF] Gerlach | A network approach to topic models[END_REF] (Fig. 7B).

The many versions of the bipartite SBM are used for what is another prototypical example of a HOrSs inference problem: latent parameter inference. Indeed, different from the configuration models, the structure of a system does FIG. 7. Inference with the bipartite stochastic block model. (A) The data represents people (as circle) interacting through events (as squares). A variation on Eq. ( 19) assigns a likelihood to every joint partitions of the people and events. A high likelihood partition is shown here using colors. Simpler methods incorrectly split the network along the black line. Figure reproduced from Ref. [START_REF] Daniel B Larremore | Efficiently inferring community structure in bipartite networks[END_REF]. (B) An elaborate hierarchical version of the bipartite SBM, applied to collections of words interacting via texts. This time the blocks (indicated by vertical dotted lines) are themselves regrouped in high-level blocks, hierarchically. Figure reproduced from Ref. [START_REF] Gerlach | A network approach to topic models[END_REF].

not trivially determine the SBM's parameters. In a configuration model, one calculates the degree of all the nodes of a given bipartite network to determine what is the associated randomized ensemble of networks. In contrast, the SBM assigns nodes to blocks via (g (A) , g (B) ), a piece of information that is typically not given-unless metadata is also available [START_REF] Hric | Network structure, metadata, and the prediction of missing nodes and annotations[END_REF]. This situation leads to a family of inference problems where the goal is to determine an assignment of nodes to the blocks, from a networks structure alone (see Fig. 7 A). This goal has been the main driving force behind the development of sophisticated model families [START_REF] Daniel B Larremore | Efficiently inferring community structure in bipartite networks[END_REF][START_REF] Tiago | Entropy of stochastic blockmodel ensembles[END_REF][START_REF] Hric | Network structure, metadata, and the prediction of missing nodes and annotations[END_REF], with formal equivalence to inference problems in other fields, like topic modeling [START_REF] Ball | Efficient and principled method for detecting communities in networks[END_REF][START_REF] Gerlach | A network approach to topic models[END_REF][START_REF] David M Blei | Latent dirichlet allocation[END_REF] or data biclustering [START_REF] Sheng | Biclustering microarray data by Gibbs sampling[END_REF].

The bipartite SBM assigns nodes to latent discrete categories (blocks), and adds connections to the network at random based on these categories. A somewhat related class of models instead assign continuous latent positions to nodes and creates connections with probabilities parametrized by the distance between nodes in the latent space. Much like the case of the bipartite CM and SBM, these models take the form of natural generalizations of simple network models to the bipartite case.

The AB random geometric graph model [START_REF] Srikanth | Percolation and connectivity in AB random geometric graphs[END_REF], for instance, is a direct extension of the well-known random geometric graph model [START_REF] Penrose | Random Geometric Graphs[END_REF]. In this model, two sets of nodes are first randomly embedded in a low-dimension Euclidean space. Nodes in different sets are then connected by edges, with a probability that depends on the distance d ij separating them. The AB random geometric graph model makes use of the simplest possible connection rule: two nodes are connected if and only if d ij < r. But we note that some unipartite models consider more complicated functional form for the connection probabilities [START_REF] Bernard M Waxman | Routing of multipoint connections[END_REF] (see also the model that follows).

Another approach to latent space models builds on results coming from the network geometry literature [START_REF] Serrano | Self-similarity of complex networks and hidden metric spaces[END_REF]. In these models, one embed nodes in an abstract space of preferences (rather than a literal space, like what is done in the AB model). It is then possible to define general classes of models by specifying different connection rules and embedding spaces [START_REF] Kitsak | Latent geometry of bipartite networks[END_REF]. The so-called S 1 × S 1 specification is perhaps the one that has been analyzed the most thus far [START_REF] Kitsak | Latent geometry of bipartite networks[END_REF][START_REF] Serrano | Uncovering the hidden geometry behind metabolic networks[END_REF]. In this version of the model, two sets of nodes are embedded uniformly at random on a circle (i.e., on the 1-sphere denoted S 1 ). The nodes are then assigned random hidden variables drawn at random from some distribution [START_REF] Kitsak | Hidden variables in bipartite networks[END_REF]-denoted φ i if node i is in set A and ψ i if it is in set B. Every pairs of nodes (i, j) in different sets are finally connected with a probability that depends on their distance d ij in S 1 , as well as the value of their hidden variables φ i and ψ j . The specific functional form analyzed in [START_REF] Kitsak | Latent geometry of bipartite networks[END_REF][START_REF] Serrano | Uncovering the hidden geometry behind metabolic networks[END_REF] is

p ij = σ d ij µ φ i ψ j ( 20
)
where µ > 0 and σ is any integrable function with image in [0, 1]. The likelihood of the whole network is therefore

P (G d, µ, φ, ψ) = ∏ ij p bij ij (1 -p ij ) 1-bij
where b ij is an entry of the incidence matrix. The role of the hidden variable is to allow for variations in the degrees [START_REF] Kitsak | Hidden variables in bipartite networks[END_REF], while the embedding helps control the level of clustering [START_REF] Krioukov | Clustering implies geometry in networks[END_REF]. [START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF]. In this model a fraction g k of nodes of degree k of a configuration model network [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF] are replaced by cliques. Figure reproduced from Ref. [START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF].

The main use-case for latent space models is, again, inference. With a latent space model, one can take a real bipartite network as input, and find the embedding in a latent space that best matches the network, using the likelihood P (G d, µ, φ, ψ) to guide the search. This inference technique has been used to, for instance, infer the latent geometry of bipartite networks of metabolites and of the reactions they intervene in [START_REF] Serrano | Uncovering the hidden geometry behind metabolic networks[END_REF].

Motifs models

Motifs-based models are formulated as assembly rules for arbitrary collections of small graphs, like triangles, short-loops, or cliques. They can be viewed as high-order models because they build systems from relationships that are not strictly pairwise, even though these models are ultimately defined as distributions over classical networks. Motifs-based models have a rich history going back to the early days of network science [START_REF] Mark | Properties of highly clustered networks[END_REF], preceded by work in sociology [START_REF] James | The structure of positive interpersonal relations in small groups[END_REF][START_REF] Paul | Local structure in social networks[END_REF] and statistics [START_REF] Frank | Markov graphs[END_REF].

The first motifs-based models of networks appeared in sociometry, motivated by the need for survey methods that would categorize and quantify patterns of interaction among small subsets of individuals of a larger directed social network [START_REF] James | The structure of positive interpersonal relations in small groups[END_REF][START_REF] Paul | Local structure in social networks[END_REF]. As we have mentioned above in Sec. IV A 1, Markov random graphs [START_REF] Frank | Markov graphs[END_REF][START_REF] Paul | An exponential family of probability distributions for directed graphs[END_REF] and their exponential random graph model (ERGM) generalization [START_REF] Wasserman | Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp[END_REF] have been proposed early on to fulfill this role. In a nutshell, these model describe maximally random distributions over networks G whose properties Q(G) = (Q 1 (G), ..., G K (G)) are fixed on average, in relative proportion controlled by the free parameters λ = (λ 1 , ..., λ K ). These models are therefore quite general in what they can describe (see our discussion above and Eq. ( 18)).

To model higher-order interactions in the ERGM framework, one can select properties Q that measure these interactions directly. An example of a set of statistics could be: the number of edges Q 1 ; the number of triangles Q 2 (a closed three-way interaction); and the number of open triangle Q 3 (an open three-way interaction).

The main inferential applications of the generic ERGM are the same as that of the bipartite ERGM: null modeling, and the construction of whole network description from local surveys [START_REF] Robins | An introduction to exponential random graph (p*) models for social networks[END_REF]. There is also at least one further application of ERGMs specific to unipartite networks: quantifying the significance of motifs. The idea here is to fix the distribution of all small motifs, and compare the number of larger motifs to the expected motifs counts in the ensemble [START_REF] Milo | Network motifs: Simple building blocks of complex networks[END_REF][START_REF] Shai S Shen-Orr | Network motifs in the transcriptional regulation network of Escherichia coli[END_REF]. This method identifies motifs that are either under-or over-represented in a graph, based on what we expect from smaller connection patterns. The method has used to argue that some small motifs are "significant subunits" that determine the function of the modeled system [START_REF] Milo | Network motifs: Simple building blocks of complex networks[END_REF].

Another type of model of networks with motifs comes from the physics literature on spreading processes occurring on clustered networks. These models tend to be very flexible and to reproduce quite a few structural characteristics of real systems. They have been first and foremost used to study how structural changes affect the outcome of dynamical processes unfolding on these networks.

One of the earliest model in this category [START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF] begins with a unipartite configuration model network, i.e., a random network that follows some arbitrary degree distribution. After the initial network is constructed, one replaces a fraction g k of the nodes of degree k with k-cliques for all k ≥ 3-selecting these nodes uniformly at random. The nodes of the new cliques are then attached to one of the edges of the node they replace, which in turn leads to a network with the same high-level structure as the original, but with added local clustering (Fig. 8). An earlier variant of this model also exists where one controls g k indirectly [START_REF] Trapman | On analytical approaches to epidemics on networks[END_REF].

Another set of model also uses the configuration model to generate HOrSs, but perhaps more directly. In the first model in this line of work, one not only specifies the degrees k = (k 1 , ..., k n ) that a node should have, but also the number of triangles in which it should participate ∆ = (∆ 1 , ..., ∆ n ) [START_REF] Newman | Random graphs with clustering[END_REF][START_REF] Joel | Percolation and epidemics in random clustered networks[END_REF]. A generalization of the classical stub-matching scheme [START_REF] Bailey K Fosdick | Configuring random graph models with fixed degree sequences[END_REF] is then used to create random network respecting these sequences. Recall that in the classical stub-matching scheme, we first assigns k 1 , k 2 , ..., k N "stubs"-half-edges-to nodes 1, 2, ..., N . We then picks a random matching of the all the stubs, in which all stubs are joined in pair to form full edges. The resulting random network respects the degree sequences k = (k 1 , ..., k N ) by construction. In the higher order stup-matching scheme, we should think of a node i as having k i "edge stubs" and ∆ i 'triangle stubs' attached to it. A network is then obtained by matching the stubs of the all nodes: 2 partial edges form an edge, and 3 partial triangles form a triangle. One variation on this models generalizes from triangles to generic cliques of size c > 3 [START_REF] James P Gleeson | Bond percolation on a class of clustered random networks[END_REF], but enforces the constraint that nodes belong to only one clique [START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF], i.e., that they have a single triangle or more generally a single clique of size c ≥ 3 attached to them. The central quantity in that model is then γ(k, c), the probability that a node has degree k and belongs to a clique of c nodes, with k ≥ c -1.

Encompassing both the triangle and the single clique model is a generalization of the configuration model that allows for generic distribution of motifs in the neighborhood of a node [START_REF] Karrer | Random graphs containing arbitrary distributions of subgraphs[END_REF]. The model parameters are the number of times a motif is attached to a node, and in which way. This can be represented, again, by "stubs" stemming from each node, where a stub of type (µ, p) is attached to node i when it participates in motif µ in position p. The final graph is constructed by matching stubs of a same type to construct motifs. Specifically, say motif µ is comprised of n 1 nodes in role p 1 , n 2 nodes in roles p 2 , etc. Then one must pick n 1 + n 2 + ... stubs of the correct types at random and create a motif connecting the nodes from which the stub stem. An even more general version of the above model assigns types (or colors) to nodes [START_REF] Allard | Bond percolation on a class of correlated and clustered random graphs[END_REF][START_REF] Allard | General and exact approach to percolation on random graphs[END_REF]. The expected number of stubs of each type for a node then depends on this type.

Inference with these general models is challenging, because it is not clear how one should select a meaningful set of motifs to describe a given graph [START_REF] Karrer | Random graphs containing arbitrary distributions of subgraphs[END_REF]. So far, the only proposed approach aiming to make this type of inference relies on an information theoretic approach to "subgraph covers" [START_REF] Wegner | Subgraph covers: An information-theoretic approach to motif analysis in networks[END_REF].

There are a few other specifications of network models with motifs that do not fit squarely in any of the above categories.

One generalizes the notion of "graphon," a form of latent space model in which nodes are assigned random positions x on [0, 1] and pairs of nodes are connected with probability parametrized by these positions. The motif generalization [START_REF] Bollobás | Sparse random graphs with clustering[END_REF] also assigns latent positions {x i } N i=1 to the nodes, drawn independently and identically according to some distribution on [0, 1]. Then, a motif µ on r nodes v 1 , ..., v r in the collection of motifs µ is added to the network with probability

P (µ v 1 , ..., v r ) = κ µ (v 1 , ...., v r ) n r-1 (21)
where κ µ is a function of the latent positions. Although these generalized graphons do not appear to have been used for inferential purposes, a few special cases of them (obtained by setting r = 2 and only allowing edges) found extensive use. For example, one can approximate κ µ to identify the latent geometry likely to have generated a network [START_REF] Newman | Generalized communities in networks[END_REF].

A completely different motif mode known as the dk-series approach fixes local motifs and maximizes randomness otherwise [START_REF] Mahadevan | Systematic topology analysis and generation using degree correlations[END_REF][START_REF] Orsini | Quantifying randomness in real networks[END_REF]. Formally, for a given k, one fixes the distribution of the number of all the motifs of k ′ ≤ k nodes centered on a node. Hence with k = 1, for example, one fixes the degree distribution, while with k = 2 one fixes the joint degree distribution of pairs of nodes. The dk-series model crosses into high-order specifications when k > 2; for example when k = 3, one fixes the distribution of wedges and triangles. This model find use in quantifying the randomness of a network's structure [START_REF] Orsini | Quantifying randomness in real networks[END_REF]. It fixes a null distribution where many local aspects are preserved, and helps to see whether these local constraints are enough to "explain" the observed large scale structure of a network. Actually carrying out the test for any k ≥ 3 is difficult, however [START_REF] Orsini | Quantifying randomness in real networks[END_REF], since constructing a single example of graphs realizing a series with k ≥ 3 is NP-complete [START_REF] Devanny | The computational hardness of dk-series[END_REF]. We note that there is related work in the social network literature, in the form of models where one specifies the local structure-the "social neighborhood" of nodes [START_REF] Pattison | Neighborhood-based models for social networks[END_REF]-up to a certain distance [START_REF] Wang | Exponential random graph model specifications for bipartite networks-A dependence hierarchy[END_REF].

Stochastic set models

Collections of motifs become rapidly intractable with growing motif sizes since there are 2 r 2 possible undirected graphs on r nodes. Many models avoid this exponential blowup by specifying the motifs stochastically, i.e., by assigning nodes to sets of r nodes and then specifying the actual motif connecting them at random. A well-known family of models specified in terms of sets takes inspiration of hierarchies in social organizations, in which nodes are assigned to nested groups [START_REF] Mark | Properties of highly clustered networks[END_REF][START_REF] Duncan | Identity and search in social networks[END_REF]. The groups are therefore proxy for higher-order interactions.

The simplest example of a model in this class only allows for one set of groups [START_REF] Mark | Properties of highly clustered networks[END_REF]. In this model, a node i has a membership number k

(n) i
(number of groups it belongs to), and a group j has a size k (g) j (the number of nodes it has). The rest of the structure is randomized. Hence, in other words the node-group relationships are described by a bipartite CM [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF]. Differently from the latter, however, one considers a projection onto the nodes (see Sec. II), in which edges are placed at random based on the group assignments. Specifically, one determines whether two nodes are acquainted through a group, with probability 0 ≤ q ≤ 1, and connects them in the projection if they are acquainted through at least one group (see Fig. 9).

Among the many possible generalizations of this model, some have: considered a deeper hierarchy of groups [START_REF] Duncan | Identity and search in social networks[END_REF]; include heterogeneities by introducing a group dependent connection probability q r [START_REF] Yang | Community-affiliation graph model for overlapping network community detection[END_REF]; introduce the possibility of forming a few 'random' links with nodes not in the immediate group of a node [START_REF] Hébert-Dufresne | Propagation dynamics on networks featuring complex topologies[END_REF]; or used a mixture of groups [START_REF] Seshadhri | Community structure and scale-free collections of Erdős-Rényi graphs[END_REF].

An alternative point of view on these models comes from the mathematics literature, where they are known as random intersection graphs [START_REF] Erdös | The representation of a graph by set intersections[END_REF]. A random intersection graph is formed by assigning a set on some alphabetsay Y = 1, .., m-to each node, and connecting two nodes if their respective sets intersect [START_REF] Micha L Karoński | On random intersection graphs: The subgraph problem[END_REF]. They are formally equivalent to the bipartite projection model above, since we can think of the set of a node as the higher-order interactions in which it participates, and of edges as arising because of these interactions (Fig. 9).

Many models of random intersections graph exist, but are somewhat less general than the projected bipartite CM discussed above. This is because mathematically exact results are typically the goal of the authors studying these models, rather than coming up with models of "realistic" HOrSs. An example of one such model is dubbed G(n, m, p). It defines a distribution over HOrSs that have m sets and n nodes, and where every node is included independently in each set with probability p [START_REF] Micha L Karoński | On random intersection graphs: The subgraph problem[END_REF], yielding the likelihood

P (B m, n, p) = n i=1 m j=1 (1 -p) Bij p Bij , (22)
for the assignments B of nodes to sets, where B ij = 1 if node i is in clique j and 0 otherwise. This model is a special case of the projected bipartite model discussed above, obtained by setting the degrees of nodes to mp, the size of groups to np, and by connecting all nodes in a shared group with probability q = 1. The properties of these random intersection graphs have since been studied extensively, see the detailed review of Frieze and Karoński [START_REF] Frieze | Introduction to Random Graphs[END_REF].

Inhomogeneous generalizations allow for some variations, such as inclusion probabilities p = (p 1 , ..., p n ) that are node dependent and fixed as parameters [START_REF] Nikoletseas | Large independent sets in general random intersection graphs[END_REF][START_REF] Deijfen | Random intersection graphs with tunable degree distribution and clustering[END_REF], or where the size of the sets are drawn from a distribution and the node in it chosen at random [START_REF] Godehardt | Two models of random intersection graphs for classification[END_REF].

While the sets themselves are random in all of the random interaction graph models above, the interior of sets themselves are not random-all nodes are connected and form a clique. Other models of intersection graphs include the possibility of noise in this process [START_REF] George | Clearing the FOG: Fuzzy, overlapping groups for social networks[END_REF], and are therefore formally equivalent to the noisy version of the nodegroup models discussed above [START_REF] Yang | Community-affiliation graph model for overlapping network community detection[END_REF]. For instance, one model assigns nodes to one or more cliques of varying sizes, and two nodes are only connected in the projection with a probability that depends on the number of shared cliques [START_REF] Barber | Clique matrices for statistical graph decomposition and parameterising restricted positive definite matrices[END_REF]. A more exotic construction assigns nodes to the cliques with probabilities p i that are the outcome of a stochastic beta process [START_REF] Sinead | Random clique covers for graphs with local density and global sparsity[END_REF].

As we have mentioned, in the mathematical literature, random intersection graphs are studied for their structural properties [START_REF] Micha L Karoński | On random intersection graphs: The subgraph problem[END_REF]. But they also find inferential application in the epidemiological literature as models of systems with higher-order interactions [START_REF] Frank | Epidemics on random intersection graphs[END_REF]. In the statistics literature, they have found application in fitting clique-cover models to real networks [START_REF] Sinead | Random clique covers for graphs with local density and global sparsity[END_REF], in the same spirit as the cover models used to fit models of networks with motifs [START_REF] Wegner | Subgraph covers: An information-theoretic approach to motif analysis in networks[END_REF].

We note in passing that some models of overlapping communities lead to formalisms close to that of the stochastic set models mentioned here. However, since one seldom thinks of overlapping communities as higher-order interactions-a typical community is far too big to classify as encoding an "interaction"-we will not review them here. The interested reader can refer to the review of Xie et al. [START_REF] Xie | Overlapping community detection in networks: The state-of-theart and comparative study[END_REF] for an overview of models of networks with overlapping communities.

Hypergraphs models

Many equilibrium models of HOrSs incorporate multi-body interactions more directly, by encoding them in hypergraphs. Much of the work on random hypergraphs comes from the mathematical literature, where they were introduced as immediate and natural generalizations of classical models in random graph theory.

Perhaps unsurprisingly, the earliest random model of hypergraphs was an extension of the well-known Erdős-Rényi (ER) model. In the most direct generalizations of this model, every hypergraph of m hyperedges of size k on n nodes is given the same probability [START_REF] Fernandez De | Sur la cardinalité maximum des couplages d'hypergraphes aléatoires uniformes[END_REF], with the ER case obtained by setting k = 2. The structural properties of the random hypergraphs generated in this way have been analyzed extensively, see [START_REF] Frieze | Introduction to Random Graphs[END_REF] for a review. A canonical variant, in which hyperedges are created independently at random with fixed probability p, also exists [START_REF] Bollobás | Cliques in random graphs[END_REF].

All hyperedges connect precisely k nodes in the two models above. This is an arbitrary choice and not a constraint of the hypergraph formalism. Other uniform models do away with this constraint, and include many sizes K = {k 1 , k 2 , ..., k } of hyperedges simultaneously (where K ⊆ N is some choice of hyperedge sizes, with K = {2} corresponding to a graph).

One version stipulates that all hypergraphs are equiprobable, provided that they have exactly m k1 hyperedges of size k 1 , m k2 hyperedges edges of size k 2 , and so on for all k ∈ K (where m and K are chosen at deterministically [START_REF] Schmidt-Pruzan | Component structure in the evolution of random hypergraphs[END_REF] or at random [START_REF] Ferraz De Arruda | Social contagion models on hypergraphs[END_REF]). Like in the classical ER case, hypergraphs that do not respect the constraint on the number of hyperedges are assigned a probability zero. Yet another uniform model instead prescribes that each of the n k possible sets of size k on n nodes exists, with a probability λ k that depends on the size k ⊆ K of the set [START_REF] Richard Wr Darling | Structure of large random hypergraphs[END_REF].

While the specifications of these models differ from cases to cases, the underlying goal is always to study the properties of the generated hypergraphs, like their components structure, for example [START_REF] Schmidt-Pruzan | Component structure in the evolution of random hypergraphs[END_REF]. Even though these uniform hypergraph model are somewhat crude approximation of real HOrSs, they have found extensive application in technical fields like computer science, where they are used to generate the structure of idealized random decision problems (random k-sat) [START_REF] Mezard | Information, Physics, and Computation[END_REF][START_REF] Dembo | Finite size scaling for the core of large random hypergraphs[END_REF].

Other uniform models differ from the ones above in that they ensure that the generated hypergraphs are "k-partite." By k-partite, it is meant that the n = k × r nodes of the hypergraph can be separated into k disjoint subsets of r nodes, such that every hyperedge comprises of precisely one node in each subset. These k-partite hypergraphs are useful when one wants to encode interactions that always involve nodes of different natures, for example, when modeling a collaborative tagging system where all hyperedges connect an element, a person, and a tag [START_REF] Ghoshal | Random hypergraphs and their applications[END_REF].

One possible construction for uniform and random k-partite hypergraphs was introduced in the mathematical literature, with the goal of studying "perfect matchings" in hypergraphs, i.e., minimal subsets of hyperedges connecting every node [START_REF] Schmidt | A threshold for perfect matchings in random d-pure hypergraphs[END_REF][START_REF] Chen | Coloring bipartite hypergraphs[END_REF]. The model first singles out one the subset of nodes as "special." Then it stipulates that, for each node in this special subset, we should choose d -1 neighbors uniformly at random (one per subset) to form a hyperedge, and repeats the process z times per node in the special set [START_REF] Schmidt | A threshold for perfect matchings in random d-pure hypergraphs[END_REF]. The resulting hypergraphs are k-partite by construction, and all the nodes in the special set have precisely degree z. A more general but still uniform model of random k-partite hypergraphs, coming from the information retrieval literature, eliminates this constraint [START_REF] Demetrovics | Asymptotic properties of keys and functional dependencies in random databases[END_REF]. Aiming for flexibility, the model assigns a different weight to every possible hyperedges, and places the hyperedges with probability proportional to these weights. It is shown that, within this framework, under entropy maximization constraints, one does not need all these weights: all the probabilities are identical under the so-called "uniform random data base model" [START_REF] Demetrovics | Asymptotic properties of keys and functional dependencies in random databases[END_REF].

Much like their graphical counterparts, the uniform hypergraph models also admit generalizations to cases where one controls the degree of nodes, i.e., the number of hyperedges incident on each node (see Sec. III A). This lead to configuration models (CM) for hypergraphs.

A configuration model for k-partite hypergraphs was proposed early in the network science literature, with the purpose of studying realistic folksonomies (tagging databases) [START_REF] Ghoshal | Random hypergraphs and their applications[END_REF]. A related model allowing for node features soon followed [START_REF] Bradde | The percolation transition in correlated hypergraphs[END_REF].

As for hypergraphs where no k-partite structure is enforced, there are quite a few recent generalizations, developed mostly with the goal of obtaining null models for community detection purposes. Indeed, one of the best-known community detection methods relies on a so-called "modularity function" [START_REF] Mark | Finding and evaluating community structure in networks[END_REF] to assign a quality to possible decompositions of a network in communities. And in particular, the modularity uses a random null model to determine whether the number edges found within a community is significant enough to warrant isolating it as a separated group. In the case of graphs, the most popular baseline is the configuration model, and many models have since been proposed recently to fulfill the same role in the case of hypergraphs. For example, a recently proposed model directly generalizes the configuration model of Chung and Lu [START_REF] Chung | Connected components in random graphs with given expected degree sequences[END_REF] to the hypergraphical case [START_REF] Bogumi L Kamiński | Clustering via hypergraph modularity[END_REF]. In this version of the model, the number of times a node participates in any given hyperedge is drawn from a multinomial distribution. This leads to a canonical version where the degrees of nodes are fixed on average. Microcanonical variants are also analyzed by Chodrow [START_REF] Philip S Chodrow | Configuration models of random hypergraphs and their applications[END_REF], and generalized to the case where the same node can take different roles in different edges (like broadcaster and receiver, for example), again by Chodrow et al. in [START_REF] Chodrow | Annotated hypergraphs: Models and applications[END_REF].

Similar models have also been recently proposed in the statistics literature, where they are used for estimation purposes [START_REF] Stasi | β models for random hypergraphs with a given degree sequence[END_REF]. These models are collectively dubbed β-models, and they are treated as generalizations of the p 1 model for graphs [START_REF] Paul | An exponential family of probability distributions for directed graphs[END_REF] (an exponential random graph approach to the configuration model, for directed graphs). They propose several flavors of the model, all making use of node propensities, i.e., of a parameter β i ∈ R to control how likely it is that node i will be connected to any given hyperedge. In the simplest proposed specification, the probability of a hypergraph H is given by

P (H β) = i1,...,ij ∈Cn(k) p ai 1 ,...,i k i1,...,i k (1 -p i1,...,i k ) 1-ai 1 ,...,i k p i1,...,i k = e βi 1 +...+βi k 1 + e βi 1 +...+βi k ( 23
)
where C n (k) is the set of all combinations of n indexes. They also propose a layered and general version where edges of different sizes co-exist. The common thread shared by all the specifications of the β-model is that, the larger the parameters β, the more likely we are to see the hyperedge a i1,...,i k in the final hypergraph H.

The stochastic block model (SBM) is another network model that has been generalized to hypergraph extensively, motived by the search for random processes able to produce hypergraphs with non-trivial mesoscopic patterns. The earliest reference to the hypergraphical SBM opts for a natural generalization from the network case [START_REF] Ghoshdastidar | Consistency of spectral partitioning of uniform hypergraphs under planted partition model[END_REF], by parameterizing the probability of hyperedges of size k with a symmetric tensor Q of dimension k, whose "rows" correspond to communities. More precisely, in this SBM the probability that an edge exists between nodes i 1 , ..., i k assigned to communities σ(i 1 )...σ(i k ) is given by q σ(i1)...σ(i k ) ∈ [0, 1]. The likelihood of a hypergraph H with adjacency tensor A is then straightforwardly:

P (H σ) = i1,...,ij ∈Cn(k) q Bi 1 ,...,i k σ(i1),...,σ(i k ) (1 -q σ(i1),...,σ(i k ) ) 1-ai 1 ,...,i k p i1,...,i k = e βi 1 +...+βi k 1 + e βi 1 +...+βi k , ( 24
)
where σ(i) is the index of the block to which node i is assigned. Ke et al. [START_REF] Tracy Ke | Community detection for hypergraph networks via regularized tensor power iteration[END_REF] add degree-correction and modify the probability of the hyperedges i 1 , ..., i k is given to q σ(i1)...σ(i k ) ∏ m j=1 β ij where β i > 0 is a propensity for node i. Ahn et al. [START_REF] Ahn | Hypergraph spectral clustering in the weighted stochastic block model[END_REF] consider weighted edges parametrized by the communities σ. Finally, Paul et al. [START_REF] Paul | Higher-order spectral clustering under superimposed stochastic block model[END_REF] combine the notion of communities with hyperedges of different sizes, albeit in a limited sense: the model conditions the presence of hyperedges of size 2 (edges) and 3 (triangles) on latent communities σ , but does not include interactions at any higher orders. In all cases, the models are introduced as a benchmark, to test whether partitioning methods-say spectral methods-can reliably recover the partition σ from hypergraph generated by the model.

A recent approach to hypergraph modeling uses an abstract embedding space to create realistic HOrSs [START_REF] Turnbull | Latent space representations of hypergraphs[END_REF], paralleling similar development in the network context (see Sec.IV A 1 above). The idea is again that if groups of nodes are close-by in the latent space, then they should tend to be connected. The specific construction considered by Turnbull et al. [START_REF] Turnbull | Latent space representations of hypergraphs[END_REF] embeds nodes randomly in R d , and adds hyperedges by connecting all set of nodes at a distance d ij < r from one another, for a few random choices of distances r (see Fig. 10). This construction allows the model to create hyperedges included within others, such as the hyperedges (c, e) and (c, e, f ) in Fig. 10. A last step is added whereby hyperedges are flipped (non-hyperedges become hyperedges and vice versa) with a small probability . This step ensures that the model assigns a non-zero probability to all hypergraphs.

The last model of hypergraphs that we review generalizes the Kronecker model [START_REF] Leskovec | Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication[END_REF], again first introduced in the context of networks. In the classical model Kronecker graph model, one starts with a small matrix P (0) , and repeatedly takes the Kronecker product of the matrix with itself to generate increasingly large matrices P (1) , P (2) , ..., P (f ) . For example, supposing that P (0) is a 2 × 2 matrix we have:

P (1) = P (0) ⊗ P (0) = p 11 P (0) p 12 P (0) p 21 P (0) p 22 P (0) = ⎡ ⎢ ⎢ ⎢ ⎢ ⎢ ⎢ ⎣
⎤ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎦ (25)
Then, once the matrix attains dimension n × n, it is used to generate a graph on n nodes in which edge (i, j) exists with probability p (f ) ij . The hypergraph generalization, called HyperKron [START_REF] Eikmeier | The HyperKron Graph Model for higher-order features[END_REF], works essentially in the same way: one starts with a small k dimensional tensor P (0) and obtains a large final tensor of dimension k and n × n × .. × n. One can then use the tensor to generate a random hypergraph, with hyperedges of size k. The model has found application in generating large realistic graphs and hypergraph quickly.

Simplicial complexes models

We complete our overview of equilibrium models with approaches formulated in the simplicial complex representation. The theoretical study of models of simplicial complexes is still in its infancy [START_REF] Kahle | Random geometric complexes[END_REF]. Save for some early work in the social sciences [START_REF] Ronald H Atkin | From cohomology in physics to q-connectivity in social science[END_REF], the abstract simplicial complex representation has seen little applications until recent years. As a result, the literature is so far limited, and mostly comes from mathematics and physics.

Before we review these models, a word of warning is in order: many authors blur the line between models of simplicial complexes and of hypergraphs. Recall that in an abstract simplicial complex, when a facet encodes an interaction between k nodes, then implied is the existence of the k faces of k -1 nodes, k(k -1) faces of k -2 nodes, and so on. This inclusion property means that all models of simplicial complexes are specified in terms of their distribution over facets (the top-level interactions). Many authors define facets as higher-order interactions, with no attention to the inclusion property. This omission has no consequence when all interactions have the same size, but can lead to different results when they do not [START_REF] Sinan G Aksoy | Hypernetwork science via high-order hypergraph walks[END_REF]. In the interest of avoiding confusion, we have modified the nomenclature favored by the authors where necessary.

The study of random simplicial complexes first started, perhaps unsurprisingly, with generalizations of the Erdős-Rényi (ER) model. The earliest model of random simplicial complexes, known as the Linial-Meshulam model, is arguably the simplest higher-order version of the ER model one can define. In this model, one begins with a connected graph on n nodes, to which some number m of triangles are added to form facets of 3 nodes [START_REF] Linial | Homological connectivity of random 2-complexes[END_REF]. The resulting object is a prototypical example of the approach favored by mathematical literature in this topic, whose focus is to find simple random objects with non-trivial homology (see Sec. III D). There has since been many generalization and analysis of this model, see the survey of Kahle [START_REF] Kahle | Topology of random simplicial complexes: A survey[END_REF] for a summary of recent results. Of particular interest is the natural generalization in which one begins with a complete simplicial complex of dimension k on n nodes and adds k + 1 facets at random [START_REF] Meshulam | Homological connectivity of random k-dimensional complexes[END_REF] (with the Linial-Meshulam model recovered by setting k = 1). A different form of ER-like models of simplicial complexes relies on the idea of flag complexes (also known as clique complexes). A flag complex is obtained by replacing all the maximal cliques of a graph by a facet. Another equivalent definition is that a flag complex is completely defined by its 1-skeleton (the underlying graph). In the model analyzed by Kahle [START_REF] Kahle | Topology of random clique complexes[END_REF], one first creates a classical ER network G, and then uses it to generate the associated flag complex. The construction is related to much earlier work in graph theory [START_REF] Bollobás | Cliques in random graphs[END_REF], where the distribution of cliques in networks drawn from the ER model was analyzed. However, in the case of Kahle [START_REF] Kahle | Topology of random clique complexes[END_REF], the focus is instead on the homology and homotopy of the resulting simplicial complexes.

To organize the rapidly growing family of models of random simplicial complexes, a model known as the "∆ensemble" has been proposed in by Kahle [START_REF] Kahle | Topology of random simplicial complexes: A survey[END_REF]. In this model, one first connects the pair of nodes of a graph with probability p 1 . Then, all the (edge-only) triangles created in this first step are closed by a face (2-simplex), independently, with probability p 2 . All the empty pyramids created as a result of closing triangles are then replaced by a 3-dimensional face with probability p 3 , and so on. One recovers the classical ER model by setting p 1 = p and all other p d to 0; the model of Linial-Meshulam by setting p 1 = 1, p 2 = p and all other p d to 0; and the model of Kahle with p 1 = p, p d = 1 for all d > 1. Fowler [START_REF] Christopher | Generalized random simplicial complexes[END_REF] and Costa and Farber [START_REF] Costa | Random simplicial complexes[END_REF] studied the homology of the simplicial complexes generated by this ensemble independently. A closely related model, also introduced by Costa and Farber [START_REF] Costa | Random simplicial complexes[END_REF], does not define the process recursively. It instead fixes the average number of faces in all dimensions as well as the number of external faces, i.e., the way in which faces of different dimensions interact. Restricted versions of these models have been used to generate simplicial complexes on which spreading process occurs [START_REF] Iacopini | Simplicial models of social contagion[END_REF] (see Sec. VII A), to predict higher-order interactions in streaming data [START_REF] Austin R Benson | Simplicial closure and higher-order link prediction[END_REF], and to study polymers [START_REF] Alberici | Aggregation models on hypergraphs[END_REF].

The ∆-ensemble is not the only general model able to encompass many models as special cases. Indeed, a different specification, in the spirit of exponential random graph discussed above, has also been introduced recently by Zuev et al. [START_REF] Zuev | Exponential random simplicial complexes[END_REF]. In this model, one defines a series of functions Q µ (S) on simplicial complexes for µ = 1, .., K. These functions can be, for example, the number of 2-facets, or much more exotic functions, like the number of homological cycles of some dimension. The exponential random simplicial complex model then assigns a probability

P (S Q, λ) = 1 Z(λ) e ∑ µ λµQµ(S) Z(λ) = S e ∑ µ λµQµ(S) (26)
to simplicial complex S and where λ is a vector of parameters controlling the relative importance of the functions Q in the ensemble. Much like the ∆-ensemble, special choices of parameters and function can be made to reproduce known models like that of Linial-Meshulam, Kahle, or even the ∆-ensemble itself [START_REF] Zuev | Exponential random simplicial complexes[END_REF].

Another rich line of inquiry focuses on random geometric simplicial complexes. These models build on a long lineage of work in topological data analysis [START_REF] Patania | The shape of collaborations[END_REF], whose focus is the recovery of topological information, such as the number of holes in a surface, from noisy objects on geometric objects embedded in space as point clouds.

In these models, one typically first place nodes in some metric space, e.g. R d , at random by drawing from a random point process. Then nodes are then connected based on their distance, generating a simplicial complex. There are two canonical ways in which this last step can be done (see Fig. 11). In random Čech complexes [START_REF] Kahle | Limit the theorems for Betti numbers of random simplicial complexes[END_REF], one places a ball of radius r around every node; whenever the intersection of k balls is non-empty, one adds a (k -1)-face between these nodes. In random Vietoris-Rips complexes [START_REF] Kahle | Random geometric complexes[END_REF][START_REF] Kahle | Limit the theorems for Betti numbers of random simplicial complexes[END_REF], instead, one connects every node at a distance at most 2r from one another, and then replace cliques by facets, effectively taking the flag complex of the underlying geometrical graph. The resulting objects have been studied for their connectivity properties and homological properties, among other things (see the thorough survey of Bobrowski and Kahle [START_REF] Bobrowski | Topology of random geometric complexes: a survey[END_REF] for more details). A fundamental result in this context concerns the limiting behavior of random geometric complexes. In particular, three regimes exist that display starkly different properties as a function of the parameter Λ = nr d , where n is the average number of points in a ball of radius r in d-dimensional space. The three regimes correspond to different limits for Λ: for vanishing Λ, the simplicial complexes are sparse, highly disconnected and dust-like; for constant Λ (also called thermodynamic regime), the homology of the complexes reaches its peak growth; and for diverging Λ, higher homology displays two phase transitions, one where the homology first appears and a second where it disappears, as cycles are progressively filled in. Finally, Fasy et al. [START_REF] Brittany | Confidence sets for persistence diagrams[END_REF] also found statistical application in the calculation of confidence interval on the results of persistent homology calculations .

In the physics literature, the focus thus far has been analogs to the configuration model (CM), with the goal of introducing heterogeneities and realistic properties in the generated random simplicial complexes. By analogy with the case of graphs, these configuration models fix the degree of nodes, defined as the number of facets incident on them. All other properties are randomized. Courtney and Bianconi [START_REF] Courtney | Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes[END_REF] considered a model where every facet is of size k and the degree of nodes is fixed exactly or on average; Kamiński et al. [START_REF] Bogumi L Kamiński | Clustering via hypergraph modularity[END_REF] have later proposed a hypergraphical CM that is formally equivalent model to the previous one. A different specification fixes the degrees exactly, and lets the facets have different dimensions while forbidding inclusions [START_REF] Young | Construction of and efficient sampling from the simplicial configuration model[END_REF]. The resulting models have been studied for their structural properties [START_REF] Courtney | Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes[END_REF] (like the projected degree or the entropy), and have found application as a null model for the homology of real systems [START_REF] Young | Construction of and efficient sampling from the simplicial configuration model[END_REF]. A recent approach to random simplicial complex [START_REF] Bianconi | Topological percolation on hyperbolic simplicial complexes[END_REF][START_REF] Bianconi | Percolation on branching simplicial and cell complexes and its relation to interdependent percolation[END_REF] follows the interpretation of the (classical) configuration model as a random branching tree [START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF]. In this model of random branching simplicial complexes [START_REF] Bianconi | Percolation on branching simplicial and cell complexes and its relation to interdependent percolation[END_REF], one starts with a single edge and attaches m faces of dimension k to each edge of the faces created in previous iterations. Crucially, k is treated as a random variable such that the dimension of every new face is random, leading to a simplicial analog to the configuration model. It is introduced to study the percolation properties of the resulting "simplicial tree."

B. Out-of-equilibrium models

All of the models we have seen thus far define distributions over static HOrSs. In other words, these models viewed HOrSs not as dynamical, evolving objects, but instead as static systems, drawn from some fixed distribution. We now turn to a different approach, mainly developed in the physics and network science literature, that adopts a dynamical point of view of HOrSs.

Since there are several similarities between many of these out-of-equilibrium models, even across different choices of representations (see Sec. II), it is worth going over some general notions before we delve in. The modeling goal motivating these models is almost always the same: finding minimal rule sets such that the typical HOrSs produced by the model reproduces the structural characteristics of empirically observed bipartite networks [START_REF] Guillaume | Bipartite structure of all complex networks[END_REF]. The rules are often chosen to allow for analytical calculations of properties of interest. But the authors of these model also often try to find rules that can be motivated mechanistically i.e., that could explain why a HOrSs evolves the way it does [START_REF] Overgoor | Choosing to grow a graph: Modeling network formation as discrete choice[END_REF].

An overwhelming majority of the out-of-equilibrium models focus on growing systems, in which nodes and edges are added as time unfolds, but never removed. This is perhaps due to the influence of foundational work in network science, where growing models were put center stage early on [START_REF] Barabási | Emergence of scaling in random networks[END_REF]. Hence, with very few exceptions, these outof-equilibrium are growth models. Furthermore, with few exceptions like the activity-driven models [START_REF] Petri | Simplicial activity driven model[END_REF], time is measured in discrete steps t = 1, 2, ..., T , where each step is associated with an event. Events typically involve the creation of a new node, or edge, or both. Echoing work on the preferential attachment model for classical networks [START_REF] Barabási | Emergence of scaling in random networks[END_REF], many of the growth events somehow favor existing nodes. As we will see, this is often achieved by selecting the nodes that receive new edges from a categorical distribution, with probabilities proportional to some growing function of the degree of the nodes already in the network.

Bipartite models

A prototypical example of out-of-equilibrium bipartite model is the model of G. Ergün, whose goal was to reproduce the evolution of sexual contact networks in a heteronormative society [START_REF] Ergün | Human sexual contact network as a bipartite graph[END_REF]. Recall that there are two sets of nodes (which we have called A and B) in a bipartite network. The model of Ergün [START_REF] Ergün | Human sexual contact network as a bipartite graph[END_REF] postulates that the evolution of the network can be explained with 3 types of events, occurring with probabilities p, q and r summing to 1. At each time step, a new node arrives in set A (with probability p), or in set B (with probability q); or a new edge appears between sets A and B (with probability r = 1 -pq). To avoid nodes of degree 0, all new incoming nodes are initially attached to one node in the opposite set, selected at random. Building on the well-known preferential attachment model [START_REF] Barabási | Emergence of scaling in random networks[END_REF], all of the choices are made preferentially. That is, whenever one or two nodes must be selected to form an edge, they are selected with probability proportional to their current degree (plus some offset specific to the set, called charisma in the original model [START_REF] Ergün | Human sexual contact network as a bipartite graph[END_REF]). Thus, the probability that a node i ∈ A is chosen at time t is calculated as

p i (t) = k i (t) + c A ∑ j∈A (k j (t) + c A ) (27)
where k i (t) is the degree of node i at time t, and c A is the offset parameter. Many variations on this theme have since been proposed. For instance, a related-and this time system-agnosticmodel of evolving bipartite networks [START_REF] Guillaume | Bipartite structure of all complex networks[END_REF][START_REF] Guillaume | Bipartite graphs as models of complex networks[END_REF] proceeds by adding new nodes to set A only. Different from the sexual network model, the degree of the incoming node is chosen from a fixed degree distribution. For each of its k edges, the new node chooses to attach to an existing node of Bm with probability λ ∈ [0, 1], or to a new one. Hence new nodes appear in set B only through their connection with incoming nodes in set A. Again choices are made preferentially, using Eq. ( 27) with c A = 0. Ramasco et al. [START_REF] José | Self-organization of collaboration networks[END_REF] make use of two distributions instead. After drawing the degree k of the new node in A, a second number ≤ k is drawn from a second distribution, determining the number of target nodes in B. These nodes are again chosen preferentially, while the kremaining degrees are attributed to new nodes in B. Beguerisse Díaz et al. [START_REF] Beguerisse Díaz | Competition for popularity in bipartite networks[END_REF] instead consider node sets whose evolution is independent of node creations. In this case, time is measured in terms of edge creation events, connecting the two sets. Different from the models above, it mixes the preferential attachment probabilities appearing in Eq. ( 27) with uniform attachment, in which nodes are chosen uniformly from the node set, i.e.,

p i (t) = 1 N (t) (28)
where N (t) is the size of the target set [START_REF] Beguerisse Díaz | Competition for popularity in bipartite networks[END_REF]. In all of the models above, the modeling goal is to reproduce the structure of empirically bipartite systems, be it sexual [START_REF] Ergün | Human sexual contact network as a bipartite graph[END_REF], collaborative [START_REF] José | Self-organization of collaboration networks[END_REF] or competitive [START_REF] Beguerisse Díaz | Competition for popularity in bipartite networks[END_REF]. Connections tend to be concentrated in these human systems, and preferential probabilities like the one appearing in Eq. ( 27) are used to induce such a skewed distributions of degrees [START_REF] Barabási | Emergence of scaling in random networks[END_REF]. Uniform probabilities like the one appearing in Eq. ( 28), on the other hand, favor more equitable distributions, which can also be found in some bipartite systems [START_REF] Guillaume | Bipartite structure of all complex networks[END_REF][START_REF] Beguerisse Díaz | Competition for popularity in bipartite networks[END_REF]. Not all out-of-equilibrium models of HOrSs can be modeled with straightforward growth models like the one above. For instance, in one model [START_REF] Sneppen | A simple model for self-organization of bipartite networks[END_REF] that is closer to the literature of self-organized criticality [START_REF] Bak | Self-organized criticality: An explanation of the 1/f noise[END_REF], nodes re-arrange their edges following connection events, and replicate the behavior of nodes to which they are connected. As another example, a different approach by Friel et al. [START_REF] Friel | Interlocking directorates in Irish companies using a latent space model for bipartite networks[END_REF] relies on a dynamical formulation of latent space models, in which nodes in the two sets A and B move in a latent space, and in which edges and edges / non-edges tend to perpetuate themselves (Fig. 12).

Other out-of-equilibrium models focus on rewiring, a process by which the edges of a bipartite network are reorganized, all the while preserving the node set. For example, Evans [START_REF] Evans | Exact solutions for network rewiring models[END_REF] start from some configuration where the nodes in one of the sets A have exactly one neighbor in the other. At each time step, a node in set A is chosen using an arbitrary selection process, and the edge connecting it to its sole neighbor in B is disconnected. A new target in B is then chosen, again arbitrarily, and a new edge is formed. It turns out that the sequence of generated bipartite networks can be described exactly at all times [START_REF] Evans | Exact solutions for network rewiring models[END_REF], and that the model allows for a number of useful generalizations, including a version of the models where the choices are driven by a superimposed unipartite network or node types [START_REF] Evans | Exact solution for the time evolution of network rewiring models[END_REF]. We note that for some choices of rewiring mechanism, averages over the rewiring process can be thought of as averages over a static ensemble of bipartite networks, such that these rewiring processes straddle the boundary between out-of-equilibrium and equilibrium models [START_REF] Bailey K Fosdick | Configuring random graph models with fixed degree sequences[END_REF].

Stochastic set models

A different category of out-of-equilibrium models focuses on how the membership of nodes to sets evolve through time. There has been relatively little work in this representation, since models that reproduce the evolution of set memberships are ironically most often couched in the language of bipartite networks [START_REF] Friel | Interlocking directorates in Irish companies using a latent space model for bipartite networks[END_REF], hypergraphs [START_REF] Paul | Local structure in social networks[END_REF], or simplicial complexes [START_REF] Wu | Emergent complex network geometry[END_REF]. That said, a few models have made explicit use of the set representation, because it turns out to be a natural choice for higher-order interaction of limited scope, and for two-mode data [START_REF] Atkin | Mathematical Structure in Human Affairs[END_REF].

These set-based models again build on the observation that the distribution of the number of sets per node and of the number of nodes per set are often heavy-tailed [START_REF] Guillaume | Bipartite structure of all complex networks[END_REF]. Hence, the evolution of these sets can be plausibly reproduced with a process in which rich-get-richer [START_REF] Barabási | The network takeover[END_REF], an observation that has been supported by the empirical analysis of evolving sets [START_REF] Pollner | Preferential attachment of communities: The same principle, but a higher level[END_REF]. Zhou et al. [START_REF] Zhou | Weighted evolving networks with self-organized communities[END_REF] harness these observations to create a model of evolving networks with communities overlain, in which nodes join communities based on their size and create connections with nodes chosen preferentially in large communities. A simpler model, known as the structural preferential attachment (SPA) model [START_REF] Hébert-Dufresne | Structural preferential attachment: Network organization beyond the link[END_REF][START_REF] Hébert-Dufresne | Structural preferential attachment: Stochastic process for the growth of scale-free, modular, and self-similar systems[END_REF][START_REF] Young | Growing networks of overlapping communities with internal structure[END_REF], incorporates the rich-get-richer mechanism without any explicit need for a network; it instead models the evolution of the sets directly. In this particular model, every time step consists of a node joining a set, with both the node and set being either new or old (such that are 2 × 2 = 4 possible outcomes). The particular type of event is determined from a categorical distribution, and every choice of nodes and sets is made preferentially with respect to the set size / membership numbers of the nodes, see Eq. [START_REF] Kashtan | Spontaneous evolution of modularity and network motifs[END_REF]. A hierarchical extension of the model exists [START_REF] Hébert-Dufresne | Complex networks as an emerging property of hierarchical preferential attachment[END_REF], where sets themselves belong to larger overlapping sets, and preferential attachment is applied at all levels.

The SPA model is closely related to the Chinese restaurant process [START_REF] David | Exchangeability and related topics[END_REF] and the related Indian Buffet Process [START_REF] Thomas | The indian buffet process: An introduction and review[END_REF], both developed to create distributions over set membership relationships, in the statistics and machine learning literature. In the Chinese restaurant process, for instance, a new element (node) is created at each time step, and either join an existing set with probability 1 -1 (t + 1) or create a new set by itself with probability 1 t. The specific set to which the incoming element is attributed is chosen preferentially. The Indian Buffet Process is defined in similar terms but allows for multiple set memberships. These process have found wide statistical applications because they satisfy an exchangeability property. Here, exchangeability means that the probability of an observed collection of sets is independent of the order in which the "growth" events actually occurred. This property greatly simplifies, for instance, the calculation of expectations over the process.

Hypergraphs models

There has been some work on out-of-equilibrium models of HOrSs in the hypergraph representation as well, mostly confined to the physics literature. In this literature, the evolving hypergraphs are often called hypernetworks, but the underlying concepts are nonetheless the same.

One of the earliest out-of-equilibrium model of hypergraphs considers the very same type of hypergraphs that were analyzed in the first equilibrium models of hypergraphs, in the physics literature: k-partite hypergraphs [START_REF] Ghoshal | Random hypergraphs and their applications[END_REF], used as models of folksonomies in which users tag items. In the model in question [START_REF] Zhang | A hypergraph model of social tagging networks[END_REF], users have intrinsic activities, corresponding to the likelihood that they will be the next user to tag an item. At each time step, one picks a random user proportionally to this activity, and then decide on both the type of tag to apply and the item to tag. The specific ways in which the choices are implemented allow for a rich-get-richer phenomenon, and the creation of new items. This particular model is somewhat unique in that most models of evolving hypergraphs focus on more general hypergraphs that need not be k-partite. Work on these general out-of-equilibrium-models of hypergraph was initiated by Wang et al. [START_REF] Wang | Evolving hypernetwork model[END_REF], where a prototypical model of growing hypergraphs was proposed. The model takes motivation in the study of how co-authorship systems evolve (with nodes being authors and hyperedges being papers). In this model, k new nodes are added at every time step, and they form a hyperedge with precisely 1 node present in the extant hypergraph, chosen proportional to its degree (the number of hyperedge incident on nodes, see Sec. III A). By construction, the model generates hypergraphs in which every hyperedge has size k.

There have since been countless variations on these rules, all leading to slightly different models. For instance, Liu et al. [START_REF] Liu | A social network model exhibiting tunable overlapping community structure[END_REF] allow the sizes of the hyperedges to vary by specifying these sizes as input (the sequence can be generated at random or deterministically). Hu et al. explore alternatives where both the size and the composition of new hyperedges to vary at random [START_REF] Hu | Hypernetwork models based on random hypergraphs[END_REF]. Guang-Yong and Jian-Guo [START_REF] Guang | A local-world evolving hypernetwork model[END_REF] introduce the notion of a "local world," by forming the new hyperedges with nodes selected in a small subset of nodes that is itself selected at random. In Wu et al. [START_REF] Wu | Synchronization of an evolving complex hyper-network[END_REF], choices are not made preferentially but instead proportionally to the "joint degree" of nodes, i.e., the number of hyperedges they share with the hyperedges that are already in the set. Finally, yet another model uses a complicated choice function to decide which nodes should be involved in new hyperedges [START_REF] Guo | Non-uniform evolving hypergraphs and weighted evolving hypergraphs[END_REF], namely

p i (t) = f (k i (t)) ∑ j f (k i (t)) (29)
where k i (t) is the degree of node i at time t, and f (k i (t)) = (k i (t) + c) γ include both an offset c and a non-linear exponent γ in the spirit of the classical model of Krapivsky et al. [START_REF] Paul L Krapivsky | Connectivity of growing random networks[END_REF]. See also [START_REF] Guo | Brand effect versus competitiveness in hypernetworks[END_REF] for a version of the function that allows for node dependent offsets and includes a node-dependent multiplicative term.

Paralleling the bipartite case (see Sec. IV B 1), these models have all been introduced to reproduce some set of characteristics of empirical systems, e.g. collaboration hypergraphs. We note, however, that the analysis of these models has so far been limited to reproducing the degree distribution of the nodes, with matching numerical simulations.

Simplicial complexes models

The last set of out-of-equilibrium models that we review are specified in the simplicial complex representations. Similar to the equilibrium models of simplicial complexes, some of these models can be interchangeably thought of as hypergraphs models, when they do not make use of the inclusion property explicitly. Hence, we have again altered the nomenclature favored by the authors when most appropriate.

There are a few approaches to dynamical models of simplicial complexes. The first work that uses simplicial complexes to model hyperbolic network geometry comes from the physics literature, where it is studied under the name of "Complex Quantum Network Manifolds" [START_REF] Wu | Emergent complex network geometry[END_REF]. These models are motivated by geometric considerations [START_REF] Bianconi | Interdisciplinary and physics challenges of network theory[END_REF], the modeling goal being to specify models of how a wide variety of discrete spaces, represented as simplicial complexes, may arise. The first model in this line of work tracks the evolution of a growing simplicial complex, made exclusively of triangles [START_REF] Wu | Emergent complex network geometry[END_REF]. At each step, a new node comes in and forms a triangle with two existing nodes, chosen uniformly from the set of all connected nodes that have less than m triangles together, where m is called the saturation bound. At each time step, with probability p ∈ [0, 1], one also closes a triangle, a process that is implemented by choosing an edge uniformly from the set of unsaturated edges, and choosing an unsaturated edge at random in the neighborhood of e 1 . With this simple model, one can create many quantitatively different outcomes, for example: planar graphs for low m, or complex geometries in the limit m → ∞, see Fig. 13.

Many variations on this model followed [START_REF] Bianconi | Complex quantum network manifolds in dimension d¿ 2 are scale-free[END_REF][START_REF] Bianconi | Complex quantum network geometries: Evolution and phase transitions[END_REF], culminating into a general model of "Network Geometry with Flavor (NGF)" [START_REF] Bianconi | Network geometry with flavor: From complexity to quantum geometry[END_REF], in which facets have all the same dimension, but are not necessarily triangles anymore. The existing facets have a latent (quenched) energy ε that is a function of the nodes they connect to, and incoming k facets are connected to an existing k -1 facet α, chosen with probability

p α (t) = e -βεα (1 + sn α ) ∑ α ′ e -βε α ′ (1 + sn α ′ ) (30)
where s ∈ {-1, 0, 1} is called the flavor of the model, β is a temperature, and n α is a the number of facets incident on α, minus one. The models that precede the NGF model are all special cases of it. For example, the model of Bianconi and Rahmede [START_REF] Bianconi | Complex quantum network manifolds in dimension d¿ 2 are scale-free[END_REF] focused on the case of triangles k = 2, with saturation parameter m = 2, flavor s = 0, and facets that have latent energies. A later model of Bianconi et al. [START_REF] Bianconi | Complex quantum network geometries: Evolution and phase transitions[END_REF] is similar, but focuses on the flavor s = 1. Some models that have followed borrow much of the mechanisms from the NGF model. For instance, the model of Courtney and Bianconi [START_REF] Owen | Weighted growing simplicial complexes[END_REF] functions more or less in the same way, but adds a mechanism to track the evolution of weights on the simplices, while that of Fountoulakis et al. [START_REF] Fountoulakis | Dynamical models for random simplicial complexes[END_REF] also works in fixed dimension but is otherwise very general, introducing the possibility to remove smaller facets when adding new ones.

Other out-of-equilibrium models of simplicial complexes favor approaches that are not related to the NGF model. For instance, one set of methods [START_REF] Sizemore | Knowledge gaps in the early growth of semantic feature networks[END_REF][START_REF] Blevins | On the reorderability of node-filtered order complexes[END_REF] by Sizemore et al. favors the flag complex approach that was also used in the context of equilibrium models by Kahle [START_REF] Kahle | Topology of random clique complexes[END_REF] (see Sec. IV A 5). In these approaches, sequences of growing graphs are first generated with a series of standard network models, like for example preferential attachment [START_REF] Barabási | Emergence of scaling in random networks[END_REF]. Then, one takes the flag complexes of these graphs by replacing every clique with a facet, yielding a sequence of growing simplicial complexes. These models have been used to study the evolution of the topological invariants of the resulting growing simplicial complexes [START_REF] Sizemore | Knowledge gaps in the early growth of semantic feature networks[END_REF] and their sensitivity to changes in the sequence of events [START_REF] Blevins | On the reorderability of node-filtered order complexes[END_REF].

Another recent-and extremely general-model moves away from the "simplicial-complexes as generalized networks" metaphor, and instead focuses on the properties of the manifold they describe, like their Hausdorff and spectral dimensions [START_REF] Diamantino C Da Silva | Complex network view of evolving manifolds[END_REF]. Many basic mechanisms by which these complex manifold may evolve are explored and classified.

A different model, introduced by Courtney and Bianconi [START_REF] Owen | Dense power-law networks and simplicial complexes[END_REF], focuses on directed triangular simplicial complexes. In this model, the simplices are either created or reinforced by first selecting a source node, proportionally to its out-strength (the total weight of triangles for which it is the source), with some probability that the node is new. To determine whether the event leads to the creation of a new simplex or to reinforcement, one then selects an edge at random in the simplicial complex, and reinforces the weight of the triangle this edge forms with the source, if its exists, or creates the triangle when it doesn't. In this case, the modeling goal is to obtain dense simplicial complexes with scale-free degree distributions.

Finally, there are some models that consider dynamical simplicial complexes-not simplicial complexes that merely grow. These models are event-based, focusing on what happens in a time slice of a continuous process [START_REF] Kim | The hyperedge event model[END_REF]. The work of Petri and Barrat [START_REF] Petri | Simplicial activity driven model[END_REF] is prototypical in this regard. In this model, each node i is endowed with an activity rate a i drawn from some distribution treated as a parameter of the model. Then, when a node i fires (at rate a i ) in continuous time, a (k -1) -simplex is created with with k -1 other nodes chosen uniformly at random. The simplex then disappears after ∆t, a parameter. In this case, the model is introduced to study the structural property of the generated simplicial complexes like the degrees aggregated over time, as well as and dynamics taking place on the simplicial complexes generated by this model (see Sec VII).

V. DIFFUSION

In the previous sections we have focused on the structure of higher order interactions. We have introduced higher order systems (HOrS) and showed their versatility in describing the structural properties of complex systems with more than pairwise couplings among their components. We will now discuss how the dynamical processes traditionally defined on networks can be extended to higher order systems. We will start in this section with diffusion, a linear process that, despite its simplicity, is of high relevance in many different contexts, and also provides an useful first approximation in the case of nonlinear dynamical systems.

Under the name of diffusion we usually indicate two distinct processes that is important to distinguish. The first one is the pure (or standard) process of diffusion, also known as the "fluid model", in which the quantity of interest moves from one region to another following the gradient of concentration. The second one is the so-called continuoustime random walk [START_REF] Masuda | Random walks and diffusion on networks[END_REF]. Here, we will first discuss these two processes in the context of networks, focusing on their similarities and differences. We will then show how to implement them on HOrS in Secs. V A and V B, respectively.

In standard diffusion on a network, a (material or immaterial) substance is allocated to the nodes of a graph and flows over each of its edges from the node with higher concentration to the node with lower concentration [START_REF] Aldous | Reversible Markov chains and random walks on graphs[END_REF][START_REF] An Samukhin | Laplacian spectra of, and random walks on, complex networks: Are scale-free architectures really important?[END_REF][START_REF] Hoffmann | Generalized master equations for non-Poisson dynamics on networks[END_REF]. The process produces a redistribution of the substance, which finally leads to a state where all the nodes have the same concentration. This state of the system, which also takes the name of consensus [START_REF] Morris | Reaching a consensus[END_REF], represents a stable equilibrium of the process, subject to detailed balance condition [START_REF] Boltzmann | Lectures on gas theory[END_REF][START_REF] Chace | The Principles of Statistical Mechanics[END_REF]. If we indicate as x i (t), with i = 1, 2, . . . , N , the concentration at the generic vertex v i at time t, the time evolution of the network state is governed by the following system of N coupled linear differential equations:

ẋi (t) = j a ij (x j (t) -x i (t)) = - j (k i δ ij -a ij )x j (t) = - j (L D 0 ) ij x j (t) (31)
where A = {a ij } is the adjacency matrix of the network, which we assume here for simplicity to be a binary and symmetric matrix (although it is straightforward to extend the formalism to directed and weighted networks), and k i = ∑ j a ij is the degree of node i. In the last equality, we have defined the diffusion Laplacian matrix:

(L D 0 ) ij = ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ k i if i = j -1 if v i ∼ v j 0 otherwise (32)
where v i ∼ v j indicates that vertices v i and v j are adjacent. In matricial form, we can write L D 0 = D -A, with D the diagonal degree matrix. Equation [START_REF] Miller Mcpherson | Birds of a feather: Homophily in social networks[END_REF] can then be written as ẋ(t) = -L D 0 x(t), where we have defined the concentration vector x = (x 1 , x 2 , . . . x N ). The fact that the homogeneous solution x (∞) = 1 ∑ i x i (0) N represents a stationary equilibrium for the process is easily proven by observing that the Laplacian, by definition, is characterized by having all the rows summing to zero, ∑ j (L D 0 ) ij = 0. For undirected networks, characterized by symmetric Laplacian, this implies from Eq. ( 31) that the total concentration ∑ i x i is conserved, and in particular ẋ(∞) = 0. The stability of such equilibrium is governed by the spectral properties of the Laplacian matrix. In fact, the solution of Eq. ( 31) can be written by projecting on the Laplacian eigenvectors, which forms a basis in the case of a connected network:

x i (t) = N α=1 c α (0)e -λαt φ (α) i = c 1 (0)φ (1) i + N α=2 c α (0)e -λαt φ (α) i (33)
where λ α and φ (α) , with α = 1, 2, . . . N are the α-th eigenvalue and eigenvector of L D 0 , while the coefficients c α (0) depend on the initial conditions. We have used the fact that one of the eigenvalues of the Laplacian is zero, because of the zero-row-sum property, which also implies that the corresponding eigenvector φ (1) is homogeneous. If the network is connected the zero eigenvalue is unique, and all the other eigenvalues are positive by definition [START_REF] Newman | Networks: An Introduction[END_REF]. Hence, we can see from Eq. (33) that x(t) will always converge to the homogeneous solution for t → ∞, the convergence time being given by the inverse of the smallest eigenvalue different from zero, λ 2 .

A qualitatively different class of processes arises when one considers continuous-time random walk. In this stochastic process a single walker jumps from one node to one of its neigbours on the network, and cannot divide or distribute itself over more than one node, as happens in standard diffusion. In this case, we consider various realizations of the process and we describe the state of the sytem by a vector q(t), representing the probability for each node to be occupied by the walker at a given time t. The probability that the walker moves from the generic node v j to v i in one step is given by the (i, j) entry of the transition matrix Π = {π ij }. In an unbiased random walk this is given by π ij = a ij k j , representing the fact that the walker on node v j can choose equally among k j neighbors. The time evolution of the occupation probability is consequently governed by a set of differential equations:

qi (t) = j π ij q j (t) - j π ji q i (t) = - j (δ ij -π ij )q j (t) = - j (L RW 0 ) ij q j (t). (34)
which is similar to that in Eq. [START_REF] Miller Mcpherson | Birds of a feather: Homophily in social networks[END_REF]. The last equality defines the random walk Laplacian L RW 0 , which is related to the diffusion Laplacian by L RW 0 = L D 0 D -1 , and for this reason is also called normalized Laplacian. In matricial form, Eq. ( 34) can be written as q(t) = -L RW 0 q(t). As well as diffusion, a random walk process is characterized by a stationary distribution where the flows of probability in each direction equal each other, and a detailed balance is reached. In this case the stationary state q (∞) corresponds to a probability distribution that is proportional to the degree of nodes: q (∞) i = k i 2K, implying that, at the equilibrium, it is more likely to find the walker on the network hubs. As for standard diffusion, also the dynamics of a random walk process is intimately related to the spectral properties of its own Laplacian operator. Again, the stationary state can be found as the Laplacian eigenvector φ (1) associated to the unique (if the network is connected) eigenvalue 0, which is indeed proportional to the vector of node degrees. The time dependent solution of Eq. ( 34) can be written analogously to Eq. ( 33), and it is thus clear that also in a random walk the velocity at which the stationary state is reached depends on the second eigenvalue (the smallest eigenvalue different from zero) of L RW 0 . Summing up in both cases of standard diffusion and random walk, the Laplacian matrix encodes the structure of the network and its spectral properties are related to the dynamical features which ultimately govern the time evolution of the state vector [START_REF] Rk | Spectral Graph Theory[END_REF].

When it comes to generalizing diffusive processes to higher order structures, many authors have attempted to extend the microscopic mechanism known to underlying diffusions in pairwise networks to larger groups of nodes. Importantly, traditional diffusion is a linear process and consequently the simplest generalization to higher-order structures can always be reduced to equations involving only pairwise couplings. For instance, as shown by Neuhäuser et al in [START_REF] Neuhäuser | Multibody interactions and nonlinear consensus dynamics on networked systems[END_REF], an extension of Eq. ( 31) to 3-body interactions can be formalized as:

ẋi (t) = jk a △ ijk [(x j (t) -x i (t)) + (x k (t) -x i (t))] (35)
where A △ = {a △ ijk } represents a tensor whose entry (i, j, k) is equal to 1 only if there is a triangle involving the three nodes i, j and k. It is easy to see that Eq. ( 35) can be rewritten in terms of a new Laplacian matrix

L △ = { △ ij } as ẋi = -2 ∑ j △ ij x j , where △ ij = δ ij ∑ kj a △ ijk -∑ k a △ ijk .
The system in Eq. ( 35) can thus be reduced to a system with pairwise interactions, where the pairwise interactions are weighted according to the organization of the HOrS under study.

To see the effects of multi-body coupling we need to insert a non-linearity in the equations, see Sec. VII. There are many ways in which this can be done. As we have seen in Sec. III E, it is possible to introduce generalized Laplacians both for diffusion and for random walk. In the next two subsections we will see how such mathematical concepts can turn useful to talk of diffusion on HOrS, when the role played by the nodes for the network Laplacian is, at higher orders, played by the edges, the triangles, the tetrahedra, etc.

A. Higher-order diffusion

A simplicial complex can be studied at different orders k ≥ 0, since for each order we can define a k-Laplacian with its spectrum and consequently its own diffusive dynamics. As a consequence, the same simplicial complex can sustain different types of diffusion, depending on the order k, or in other words, depending on the dimension of the simplices over which the diffusion is defined. The idea is to indicate as x σ (t) the concentration, at time t, at the generic simplex σ of order k, and to consider the following set of coupled dynamical equations:

ẋσ (t) = - σ ′ ∈X k (L D k ) σσ ′ x σ ′ (t) (36)
where L D k is the combinatorial Laplacian based on the upper and lower matrices of dimension k that we have introduced in Sec. III E [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF]. Notice that we have N k of these equations where N k = X k , and X k represents the set of all simplices of dimension k in the simplicial complex under study. The system in Eq. ( 36) generalizes the one in Eq. ( 31) and reduces to the latter when k = 0. In this more general setting the substance that is diffusing is not bounded to live at the nodes of a network, but depending on the value of k ≥ 1, is located at the edges (when k = 1), or the triangles (k = 2), or higher-order simplices of a HOrS, respectively. In analogy with Eq. ( 33), the general solution to Eq. ( 36) can be written as [START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF]:

x σ (t) = N k α=1 e -µαt φ (α) σ σ ′ ∈X k φ (α) σ ′ x σ ′ (0) (37)
where µα and φ (α) are respectively the eigenvalues and eigenvectors of the Laplacian L D k . The authors of Ref. [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF] have estimated how fast the system relaxes to equilibrium. If x(t) indicates the vector whose N k entries represent the concentrations at time t at the N k simplices of order k, the bounds they have found, when the systems is started at x(0), read:

1 µ 2 L D k x(t) ≤ x (∞) -x(t) ≤ N k exp(-µ 2 t) x(0) (38)
where x (∞) = lim t→∞ x(t), µ 2 is the smallest non-zero eigenvalue of L D k , and ⋅ is the usual Euclidean norm. Torres and Bianconi [START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF] have studied Eq. ( 36) on simplicial complexes generated by the NGF model (see Sec. IV B 4), and have focused on the spectral (and thus dynamical) differences between different orders k. In particular, they have generalized to HOrSs the concept of spectral dimension. In a network, the spectral dimension is the dimension of the network "as seen by a diffusion process" and is defined from the exponent of the power-law scaling of the density ρ(µ) of the eigenvalues of the standard Laplacian (the network spectral density) when µ ≪ 1 [START_REF] Burioni | Universal properties of spectral dimension[END_REF][START_REF] Ana P Millán | Synchronization in network geometries with finite spectral dimension[END_REF]. Figure 14A shows that a similar definition can be adopted for HOrSs, and that the spectral dimension of simplicial complexes generated by the NGF model increases with the order k. Moreover, the authors of Ref. [START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF] have found an analytical relation between the spectral density and the return-time probability, reported in Fig. 14B. The latter is defined in HOrSs as the probability that, starting from an initial state which is localized on a given simplex σ, the diffusion process comes back to the simplex σ at time t, averaged over all simplices σ. Such a relation strengthens the link between spectral dimensions and the dynamical behaviour of high-order diffusion processes on HOrSs.

Edge-flows

The special case k = 1, the so-called edge-based Laplacian, is a particularly important case of the k-th order Laplacian L D k we have discussed above. Edge-flows turn in fact very useful in many contexts, ranging from graph-based machine learning to signal analysis.

In graph signal processing, although the basic approach is to consider the signals at the nodes of a graph, an edge-based approach becomes important when we need to analyze a flow (of mass, energy, information, traffic, etc.). In such cases, a vertex-based analysis cannot take into account notions like the orientation of flows, which is instead considered in the edge Laplacian by the sign of the entries. The natural generalization has been studied by Schaub and Segarra, who have used the spectrum of the combinatorial Laplacian L D 1 to decompose the space of edge-flows into harmonic and gradient flows [START_REF] Michael | Flow smoothing and denoising: Graph signal processing in the edge-space[END_REF]. Within this framework the authors have been able to address the problem of denoising and smoothing of flow signals by means of a series of filters that enforce approximate flow-conservation in the processed signals. They also show an application of their methods to denoise vehicular traffic flows in street networks.

The authors of Ref. [START_REF] Jia | Graph-based semi-supervised & active learning for edge flows[END_REF] have instead considered the problem of semi-supervised learning (SSL) for edge-flows in networks. Given a graph G(V, E) edge-flows are defined by a set of real-valued functions f ∶ V × V → R, such that:

f (i, j) = -f (j, i) ∀(i, j) ∈ E 0 otherwise.
The authors make use of the edge-Laplacian and focus on divergence-free flows (i.e. cases in which the flow is approximately conserved) in order to define a process where, given a set of labeled edge-flows it is possible to infer the unlabeled edge-flows. In particular they study how to select the fraction of most informative edges in order to accurately infer the remaining ones. Figure 15 illustrates the relation between a vertex-based and the edge-based SSL. An application of the method to real-world street networks proves its superiority with respect to traditional alternatives.

B. Higher-order random walks

Random walks on simplicial complexes

An example of higher-order random walk in which the walkers populate the edges instead of the nodes has been proposed by Schaub et al. [START_REF] Michael T Schaub | Random walks on simplicial complexes and the normalized Hodge Laplacian[END_REF]. The Laplacian L D 1 defined in Sec. III E is characterized by positive and negative entries that depend on the edge orientations. Therefore, differently from the standard random walk Laplacian, the non-diagonal entries do not reflect the transition probabilities among nodes. It is however possible to define a normalized variant L RW 1 of the Laplacian L D 1 which can be related to an edge-based random walk process. The idea is to consider a random walk in a higher dimensional lifted state space. In other words, instead of considering L D 1 applied to an edge-flow function f of the co-chain space C 1 , Schaub et al. propose a sequence of three operations: the lifting of f into a higher dimensional space, the action of a linear operator (playing the role fo L RW 1 ) and the projection back down to the original state space. The linear transformation in the lifted space can be normalized so as to represent a random walk. This procedure allows to interpret the components of the flow in the following way: the magnitude represents the volume of the flow, while the sign indicates the orientation, which can be aligned or anti-aligned with the chosen reference orientation. The higher space where the co-chain vector is lifted up has double the size of C 1 since both possible orientations for each edge are present. The effect of the Laplacian can be split in two contributions, taking into account connections at the upper and lower order respectively. At each time step, the walker takes a step via either the upper or the lower adjacency connections, with equal probability. If the lower connection space is chosen, the walker has probability 1/2 of moving along the reference edge orientation and 1/2 of moving against. The transition probability towards a target edge is, in each case, proportional to the upper degree (or weight) of the edge. If instead the walker makes a step via the upper adjacency connections, there are two cases: if the edge has no upper adjacent faces, the walker stays at the same edge and can change orientation with probability 1/2; if instead the edge has upper adjacent faces, then the walker will transition to an upper adjacent edge with a different orientation with respect to their shared face. In other words, the walker performs a random walk with adjacency matrix A u , unless there is no upper adjacent connection, in which case the walker can stay put or move to the edge with reverse orientation. It is important to observe that the eigenvectors of L RW 1 relative to the eigenvalue µ = 0 are associated to harmonic functions. Schaub et al. propose an application of their random walk trajectory embedding and simplicial PageRank [START_REF] Michael T Schaub | Random walks on simplicial complexes and the normalized Hodge Laplacian[END_REF].

A second example of a higher-order random walk in which the walkers live instead on the triangles of a HOrS has been proposed by Mukherjee et al. [START_REF] Mukherjee | Random walks on simplicial complexes and harmonics[END_REF]. The authors have considered a special case of a simplicial complex where every edge is contained in at most two triangles. At each time step t, a walker at a triangle σ remain still with probability 1/2, or otherwise move to a triangle on the other side of one of the three edges of σ. In other words, at each time step, the walker can move to a triangle that is lower adjacent to the current triangle. The transition matrix Π = {π σσ ′ } of the walker reads:

π σσ ′ = ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ 1 2 if σ = σ ′ 1 6 if σ and σ ′ share an edge 0 otherwise. ( 39
)
and is possible to show that it can be expressed in terms of the higher order Laplacian L D 2 as Π = I -L D 2 6.

Random walks on hypergraphs

The hypergraph formalism is simple enough to allow to consider random walks on hypergraphs of arbitrarily large order.

A first basic model of random walk on hypergraphs has been proposed by Zhou et al. [START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF]. In their implementation, the walker selects one of the hyperedges of the current node, and then chooses to move to one of the nodes of the selected hyperedge with a uniform probability. In principle, hyperedges can be weighted according to different criteria. However, in their numerical experiments the authors adopt the case in which each hyperedge is assigned a weight equal to 1. Zhou et al. use their random walk model to perform a classification task. They make use of a dataset [START_REF] Dua | UCI machine learning repository[END_REF], in which the animals of a zoo are associated to a set of features (tail, hair, legs and so on), and build a hypergraph where each animal is a node and two or more nodes are in the same hyperedge if the corresponding animals have a common feature. The eigenvectors associated to the smallest non-zero eigenvalues µ α of the random walk Laplacian on this hypergraph are then used in order to embed each animal in a two-dimensional Euclidean space. Figures 16A,B show the classification performance of the method when the 2nd and 3rd smallest eigenvalues, µ 2 and µ 3 , or the 3rd and 4th smallest eigenvalues, are used respectively.

Carletti et al. have instead proposed a random walk model in which the walkers spend more time inside larger communities [START_REF] Carletti | Random walks on hypergraphs[END_REF]. In practice, this is obtained by considering the basic model of Ref [START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF] and assigning to each hyperedge a weight that is proportional to its size. In this way, the transition probability reflects the interplay between the walker's willing to explore the network and the attractiveness of large hyperedges. The authors of Ref. [START_REF] Carletti | Random walks on hypergraphs[END_REF] have provided an analytical description of the process and of its stationary state. They make use of a different Laplacian operator suitably defined to generalize the standard random walk, and which reduces to the traditional pairwise Laplacian when all hyperedges are of size 2 and the hypergraph reduces to a graph. The results obtained for this random walk on a given hypergraph are compared with those obtained by a traditional random walk on a projected network, where the hyperedges of the original hypergraph are transformed into cliques. This is illustrated with the example reported in Fig. 17. The hypergraph in Fig. 17A is composed of one hyperedge of size k, where one of the nodes, denoted as c, is also connected to a hub node, h, which is at the center of m hyperedges of size 2. The corresponding projected network is shown in Fig. 17B. The difference between the HOrS and its projection clearly emerges from the node rankings based on the stationary probability distribution of the walkers in the two cases. In the case of the projected network, the equilibrium distribution q (∞) is proportional to the degree of the nodes. This means that q (∞) h ∝ m and q (∞) c ∝ k, which implies that the hub node h is the top node in the ranking when m > k. The stationary distribution of the random walk on the hypergraph, denoted as p (∞) , gives instead p [START_REF] Carletti | Random walks on hypergraphs[END_REF]. Consequently, the hub node h results the node with the highest occupation probability only ϕ (3) ϕ (2) ϕ (4) ϕ (2) when m > 1 + (k -1) 2 . In general, at fixed hyperedge order k, the two processes provide the same ranking for m < k + 1 or m > 1 + (k -1) 2 . Conversely, at intermediate values of m, the hub h is the top node in the projected network, while node c is ranking first in the hypergraph. The inversion is graphically shown in Figs. 17C-F. The authors of Ref. [START_REF] Carletti | Random walks on hypergraphs[END_REF] have proposed concrete applications of their random walk model to rank nodes in large systems. For instance they have produced a ranked list of scientists based on the hypernetwork representing co-authorship relations in published articles (see Sec. IX A for scientific collaborations as HOrSs) . The same model has also been used for classification task. Figure 16C shows the three-dimensional embedding (defined by the eigenvectors associated to the first three eigenvalues) obtained for the zoo data set.

(∞) h ∼ m and p (∞) c ∼ 1 + (k -1) 2
Chitra and Raphael [START_REF] Chitra | Random walks on hypergraphs with edge-dependent vertex weights[END_REF] go beyond the previous approaches, and propose a model of random walks on hypergraphs with edge-dependent vertex weights. Namely, they consider a transition probability assigning different weights even to nodes belonging to the same hyperedge. In their random walk, a walker at node v j at time t move to a node v i chosen in the following way. First, a hyperedge σ is selected among all the hyperedges of v j with probability ω(σ) d(v j ), where ω(σ) is the weight of the hyperedge and and d(v j ) is the degree of v j . Then a node v i is selected from hyperedge σ with a probability γ σ (v i ) δ(σ), where γ σ (v i ) is the weight of vertex v i and δ(σ) = ∑ vi∈σ γ σ (v i ) is the degree of the hyperedge σ. The novelty of this random walk with respect to previous models on hypergraphs with edge-independent vertex weights consists in the second step, where the probability is not uniform over all the vertices of σ. Chitra and Raphael claim that for a random walk on hypergraphs with edge-independent weights is always possible to find a choice of edge weights such that the process on the hypergraph is equivalent to a traditional random walk on the corresponding projected network with such chosen weights. The proof of equivalence is based on the time-reversibility of the process, which is a typical property of the associated Markov chain. Such property cannot be extended to hypergraphs with edge-dependent weights, which happen to be not time-reversible. Therefore, random walks on hypergraphs with edge-dependent vertex weights cannot be reduced to traditional random walks on weighted networks. This generalizes a result already found in [START_REF] Agarwal | Higher order learning with graphs[END_REF] for k-uniform hypergraphs. Notice that, without using edge-dependent weights, another way to obtain a higher order random walk which is not reducible to the traditional model is, similarly to what happens for diffusion, to insert a non-linearity in the equations, as it has been done by Chan et al. [START_REF] Hubert Chan | Spectral properties of hypergraph Laplacian and approximation algorithms[END_REF], and by Li and Milenkovic in [START_REF] Li | Inhomogeneous hypergraph clustering with applications[END_REF], and [START_REF] Li | Submodular hypergraphs: P-Laplacians, Cheeger inequalities and spectral clustering[END_REF]. In the model by Chitra and Raphael the stationary state p (∞) , can be analytically computed. If for the traditional processes this can be written as by p (∞) i = ρ ∑ σ∈E(vi) ω(σ), with E(v i ) the set of hyperedges containing v i , the process proposed by Chitra and Raphael brings to p (∞) i = ∑ σ∈E(vi) ρ σ ω(σ)γ σ (v i ), i.e. the proportionality constant ρ depends on the hyperedge and each term in the sum is multiplied by the vertex weight. By making use of this definition the authors also provide an application example, again based on scientific collaborations. They obtain the ranking of different scientists according to a hypergraph where hyperedges represent articles and the authors have weights which reflect their appearance order (first/last or middle authors), and they compare such ranking to that obtained by a random walk on the corresponding edge-independent hypergraph. Other applications of edge-dependent hypergraphs include e-commerce [START_REF] Li | E-tail product return prediction via hypergraph-based local graph cut[END_REF], text ranking [START_REF] Bellaachia | Random walks in hypergraph[END_REF], image visualisation and processing [START_REF] Ding | Interactive image segmentation using probabilistic hypergraphs[END_REF][START_REF] Huang | Image retrieval via probabilistic hypergraph ranking[END_REF][START_REF] Ducournau | Random walks in directed hypergraphs and application to semi-supervised image segmentation[END_REF][START_REF] Zeng | Learn to rank images: A unified probabilistic hypergraph model for visual search[END_REF][START_REF] Zhang | Dynamic hypergraph structure learning[END_REF].

Random walks on hypergraphs have also been used to study graph expansion. Louis in [START_REF] Louis | Hypergraph Markov operators, eigenvalues and approximation algorithms[END_REF] introduces a nonlinear Laplacian operator on hypergraphs as a generalization of the random walk Laplacian operator on graphs and studies its spectrum. He in particular proves that the second smallest eigenvalue is related to the expansion of the hypergraph, generalizing the Cheeger's inequality. A similar process is analysed by Chan et al [START_REF] Th Chan | Spectral properties of Laplacian and stochastic diffusion process for edge expansion in hypergraphs[END_REF] considering a diffusive flow from the node with maximum density to the one with minimum density within a hyperedge. The two works are merged together in [START_REF] Hubert Chan | Spectral properties of hypergraph Laplacian and approximation algorithms[END_REF]. A generalization of this process is provided in [START_REF] Hubert | Generalizing the hypergraph Laplacian via a diffusion process with mediators[END_REF], while in [START_REF] Hubert Chan | Diffusion operator and spectral analysis for directed hypergraph Laplacian[END_REF] the framework is extended to directed hypergraphs. Li and Milenkovic [START_REF] Li | Submodular hypergraphs: P-Laplacians, Cheeger inequalities and spectral clustering[END_REF] answer the same questions on a different kind of higher order network, named submodular hypergraph, for which they define a different Laplacian and analyze its spectrum.

Higher order random walks have also been used for applications such as node ranking [START_REF] Bellaachia | Random walks in hypergraph[END_REF], community structure detection [START_REF] Charles | Simplex2Vec embeddings for community detection in simplicial complexes[END_REF], topological data analysis [START_REF] Salnikov | Simplicial complexes and complex systems[END_REF], machine learning [START_REF] Hoang Tran | Combinatorial and random walk hypergraph Laplacian eigenmaps[END_REF][START_REF] Sai Nageswar Satchidanand | Extended discriminative random walk: A hypergraph approach to multi-view multi-relational transductive learning[END_REF], and even quantum walks have been extended beyond pairwise connections [START_REF] Liu | Quantum walks on regular uniform hypergraphs[END_REF]. The traditional definition of cover time in random walk, i.e. the maximum expected time to visit all the vertices of a graph, has been extended to hypergraphs in [START_REF] Cooper | The cover times of random walks on hypergraphs[END_REF]. While Avin et al. [START_REF] Avin | Radio cover time in hyper-graphs[END_REF] define a higher-order random walk suitably designed to describe communication over a wireless shared channel, which is not well captured by a traditional network.

Finally, another interesting extension would be to consider reaction-diffusion systems based simplicial complexes or hypergraphs, which historically represent the basic processes for pattern formation [START_REF] Mathison | The chemical basis of morphogenesis[END_REF][START_REF] Nakao | Turing patterns in network-organized activator-inhibitor systems[END_REF][START_REF] Asllani | The theory of pattern formation on directed networks[END_REF][START_REF] Cencetti | Pattern invariance for reaction-diffusion systems on complex networks[END_REF]. For instance, higherorder interactions have been considered in [START_REF] Harush | Dynamic patterns of information flow in complex networks[END_REF], where the cumulative response of nodes to a specific signal is investigated by means of the flow patterns stemming from the interplay between topology and dynamics in a coupled reaction system.

VI. SYNCHRONIZATION

Synchronization is the emergence of order in populations of two or more coupled dynamical systems. It shows up in many physical, biological and social systems, and at different scales, with typical examples including the synchronized motion of weakly coupled pendulum clocks [START_REF] Huygens | The pendulum clock[END_REF], the clapping of an audience [START_REF] Néda | The sound of many hands clapping[END_REF] or the flashing of fireflies [START_REF] Buck | Synchronous rhythmic flashing of fireflies[END_REF]. Synchronization has been an active research topic in the last decades with successful applications ranging from neuroscience to climatology and engineering [START_REF] Boccaletti | The synchronization of chaotic systems[END_REF][START_REF] Pikovsky | Synchronization: A Universal Concept in Nonlinear Sciences[END_REF][START_REF] Strogatz | Sync: The Emerging Science of Spontaneous Order[END_REF][START_REF] Boccaletti | Synchronization: From Coupled Systems to Complex Networks[END_REF]. Interactions play a key role in the emergence of synchronization, which is why network science provides natural and powerful tools to inquire about the nature and the underlying mechanisms of synchronization. In synchronization on networks, each node of a graph is a dynamical system, and its dynamics is influenced by its neighbours through pairwise interactions. Synchronization occurs when the interactions are such that all, or a macroscopic fraction of, the oscillators reach a coherent state. Historically, this was made clear by Kuramoto and his mathematically tractable model of all-to-all coupled phase oscillators [START_REF] Kuramoto | Chemical Oscillations, Waves, and Turbulence[END_REF]. The Kuramoto model paved the way for others to study the effects of complex topologies [START_REF] Juan A Acebrón | The Kuramoto model: A simple paradigm for synchronization phenomena[END_REF][START_REF] Arenas | Synchronization in complex networks[END_REF][START_REF] Rodrigues | The Kuramoto model in complex networks[END_REF]. Key results have shed light on the relationship between network synchronizability and topology, e.g. the improved synchronizability of small-world networks [START_REF] Barahona | Synchronization in small-world systems[END_REF], and have revealed different routes to synchronization, such as abrupt synchronization in scale-free networks [START_REF] Gómez-Gardenes | Explosive synchronization transitions in scalefree networks[END_REF][START_REF] Boccaletti | Explosive transitions in complex networks' structure and dynamics: Percolation and synchronization[END_REF]. In addition, different types of synchronized behaviors have been identified and linked to specific properties of the network structure, including remote synchronization [START_REF] Nicosia | Remote synchronization reveals network symmetries and functional modules[END_REF], cluster states [START_REF] Louis M Pecora | Cluster synchronization and isolated desynchronization in complex networks with symmetries[END_REF], chimera [START_REF] Daniel | Chimera states for coupled oscillators[END_REF] and Bellerophon [START_REF] Bi | Coexistence of quantized, time dependent, clusters in globally coupled oscillators[END_REF] states. The existence and properties of these phenomena depend on the type of interactions, but also on the topology of the network. See Refs. [START_REF] Boccaletti | Synchronization: From Coupled Systems to Complex Networks[END_REF][START_REF] Arenas | Synchronization in complex networks[END_REF][START_REF] Rodrigues | The Kuramoto model in complex networks[END_REF] for comprehensive reviews.

In this Section, we discuss how coupled dynamical systems can be extended to higher-order systems (HOrSs), and how the presence of high-order interactions can affect synchronization in both phase oscillators and nonlinear dynamical systems. As we will show below, higher-order interactions can change the nature of the transition to synchronization, can favor the emergence of certain collective phenomena, e.g. cluster states, and can even give rise to new dynamical regimes.

A. Phase oscillators

In this section, we report on studies that investigate synchronization in populations of phase oscillators: the most basic oscillatory unit which is fully described by a phase.

Higher-order Kuramoto model

The Kuramoto model captures the essence of the emergence of synchronization in a mathematically tractable setting [START_REF] Kuramoto | Chemical Oscillations, Waves, and Turbulence[END_REF]. In the original model, the state of oscillator i (i = 1, . . . , N ) at time t is described by its phase θ i (t) ∈ [0, 2π[. The dynamics of each oscillator is governed by its interactions with all other oscillators (all-to-all interactions) according to:

θi = ω i + K 1 N N j=1 sin(θ j -θ i ), (40)
where ω i denotes the natural frequency associated to i, drawn from a given distribution g(ω), and K 1 > 0 is the (pairwise) coupling constant. In this model, two opposing driving forces are at play: heterogeneity in the natural frequencies pushes the oscillators away from synchronization, while interactions favor synchronization. As a result of this, we observe a phase transition. Above a critical value, K * 1 , of the coupling strength, the oscillators synchronize their frequency, so that their phase difference does not change in time (this is known as phase locking). This phase transition from incoherence to synchronization can be captured by the usual complex order parameter t) , a macroscopic quantity that characterizes the collective dynamics of the entire system. The modulus 0 ≤ R 1 (t) ≤ 1 measures the phase coherence, while 0 ≤ Φ(t) < 2π is the average phase of the whole population of oscillators. When K 1 < K * 1 , the oscillators behave incoherently and R 1 ≈ 0. When K 1 is above the critical value, instead, the oscillators synchronize and R 1 ≠ 0. As K 1 tends to large values, R 1 tends to 1, corresponding to all oscillators having exactly identical phases, a case that can be obtained for identical oscillators, i.e. when ω i = ω ∀i [START_REF] Watanabe | Integrability of a globally coupled oscillator array[END_REF][START_REF] Watanabe | Constants of motion for superconducting Josephson arrays[END_REF]. To make the driving of the mean field explicit, the system in Eq. ( 40) can be rewritten as: About ten years ago, Ott and Antonsen proved that the dynamics of the system in Eq. ( 41) reduces to a stable low-dimensional synchronization manifold, by applying self-consistency arguments to the evolution of the distribution of the oscillator phases [START_REF] Ott | Low dimensional behavior of large systems of globally coupled oscillators[END_REF].

Z 1 (t) = R 1 (t)e iΦ1(t) = 1 N ∑ N j=1 e iθj (
θi = ω i + K 1 R 1 sin(Φ 1 -θ i ). (41)
The Kuramoto model can be extended from the original all-to-all interactions to the case in which the oscillators are the nodes of a network and their couplings are governed by the adjacency matrix A = {a ij } of the network. Formally, this is equivalent to consider the equations:

θi = ω i + K 1 N N j=1 a ij sin(θ j -θ i ). (42)
The Kuramoto model has been studied on different types of complex networks, and particular attention has been devoted to investigate how the structural properties of a network affect synchronization. A review of the main results obtained can be found in Refs. [START_REF] Juan A Acebrón | The Kuramoto model: A simple paradigm for synchronization phenomena[END_REF][START_REF] Arenas | Synchronization in complex networks[END_REF]. In what follows, we will review more recent works that extend the Kuramoto model to higher-order networks, starting with a short detour on synchronization on motifs.

Motifs are small graphs that appear in a statistically significant way in real networks [START_REF] Alon | Network motifs: Theory and experimental approaches[END_REF]. This is why studying synchronization in motifs can help understanding the dynamics of large networks and is also the first step towards an explicit treatment of synchronization in a HOrS. A first study by Moreno et al. [START_REF] Vega | Fitness for synchronization of network motifs[END_REF] investigated if some motifs of Kuramoto oscillators are more synchronizable than others. For each undirected small graph of N = 3 and 4 nodes, the authors evaluated its probability to synchronize by considering many random realizations of the set of natural frequencies {ω i } N i=1 drawn from a given distribution g(w), and computing the fraction of realizations for which the graph synchronizes. As expected, the probability of synchronization increases with the coupling strength K 1 . Additionally, they have evaluated a threshold coupling strength K1 , as the value of K 1 above which the probability of synchronization is greater than 0.5. The main result of the study is that, at fixed number of nodes, the larger the number of links is, the lower the value of K1 , i.e. the easier it is for the graph to synchronize. This is shown in Fig. 18 for graphs with four nodes. The authors suggest this could help understand why some motifs, which appear in biological networks and are more conserved across evolution, have a higher link density than others.

In a following study, D'Huys et al. have investigated the influence of time delays in the synchronization of motifs [START_REF] Otti | Synchronization properties of network motifs: Influence of coupling delay and symmetry[END_REF]. The authors studied the existence and stability of several types of synchronized behaviors, in unidirectionally and bidirectionally coupled small rings, pairs of oscillators, and open chains. The work showed that delays tend to induce multistability in unidirectional rings, in contrast to what happens in bidirectional rings.

More recent works have studied variations of the Kuramoto model that explicitly include higher-order interactions. Skardal and Arenas [START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF] have investigated what happens when all-to-all pairwise interactions are replaced by pure three-body interactions, considering the system:

θi = ω i + K 2 N 2 N j=1 N k=1 sin(θ j + θ k -2θ i ), (43)
which is a direct generalization of the original Kuramoto model in Eq. [START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF]. Now, the dynamics is ruled by interactions of all possible triplets of oscillators (i, j, k) in the system (corresponding to a hypergraph with all 3-node hyperedges).

The value of the coupling strength K 2 tunes the strength of such interactions. Notice that the number of three-body interactions node i is involved in, scales as N 2 , which explains the presence of the normalization factor 1 N 2 to ensure a smooth thermodynamic limit. The system in Eq. ( 43) can be cast into the following form: where R 1 (t) and Φ 1 (t) are, as in Eq. ( 41), the modulus and the phase of the complex order parameter Z 1 (t). By arguments of continuity and self-consistency of the oscillator density, the authors then derived analytical formulae for the dynamics of Z(t) and of a second order parameter ) , which is a typical indicator of 2-cluster states. Indeed, R 2 ≈ 0 for incoherent states, while R 2 ≈ 1 for 2-cluster states when the two clusters have a phase difference equal to π. Two main novel dynamical phenomena were identified. Firstly, the three-body interactions give rise to an abrupt desynchronization transition, which is not present in the classical Kuramoto model of Eq. ( 40). In other words, as shown in Fig. 19, as the coupling strength K 2 is decreased from large values, the order parameter R 1 drops from positive values to zero. On the other hand, increasing K 2 back does not yield a transition to coherence since the incoherent state is stable for any coupling strength. Second, the three-body interactions yield multistability: for large enough values of the coupling strength K 2 , there exist infinitely many stable coherent branches that correspond to 2-cluster solutions. Each of these stable 2-cluster solutions can be distinguished by the relative size η of the two clusters, i.e. the relative number of oscillators in the two clusters. Interestingly, each of the stable branches undergoes an abrupt desynchronization transition at a different value of K 2 , so that there is actually a continuum of transitions. Very recently, Xu and coworkers have studied the same system using bifurcation theory and the symmetries of the SO 2 group to reveal scaling properties of the transitions [START_REF] Xu | Bifurcation and structural stability of simplicial oscillator populations: Exact results[END_REF]. The authors show that their analysis generalizes to a coupling scheme where natural frequencies are correlated to the coupling strength.

θi = ω i + K 2 R 2 1 sin[2(Φ 1 -θ i )], (44)
Z 2 (t) = R 2 (t)e iΦ2(t) = 1 N ∑ N j=1 e i2θj (t
That higher-order interactions favor multistability is a general trend, and this is also in agreement with the results of some earlier studies [START_REF] Tanaka | Multistable attractors in a network of phase oscillators with three-body interactions[END_REF][START_REF] Ashwin | Hopf normal form with S N symmetry and reduction to systems of nonlinearly coupled phase oscillators[END_REF][START_REF] Komarov | Finite-size-induced transitions to synchrony in oscillator ensembles with nonlinear global coupling[END_REF]. Already in 2015, Komarov and Pikovsky [START_REF] Komarov | Finite-size-induced transitions to synchrony in oscillator ensembles with nonlinear global coupling[END_REF] studied Eq. ( 43) in great detail for identical and distributed frequencies, with or without common noise. The main focus of their study is different to Ref. [START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF]: here, the authors show that while the incoherent state R 1 = 0 is always stable in the thermodynamic limit, finite-size fluctuations can induce a transition to synchrony 0 < R 1 ≤ 1. The authors explained this transition by showing that, remarkably, the order parameter scales as R 1 ∼

√

N with the size of the system, which vanishes in the thermodynamic limit. Even earlier, in 2011, motivated by the importance of many-body interactions in signal transmission between neurons, Tanaka and Ayogi [START_REF] Tanaka | Multistable attractors in a network of phase oscillators with three-body interactions[END_REF] studied a system similar to the one in Eq. [START_REF] Lancichinetti | Benchmark graphs for testing community detection algorithms[END_REF]. They have considered a coupling function of the form sin(θ j -θ i ) cos(θ k -θ i ), which indeed corresponds to the first of the two terms to which the original coupling function in Eq. ( 43) reduces when using the trigonometric identity for the sine of a sum [START_REF] Tanaka | Multistable attractors in a network of phase oscillators with three-body interactions[END_REF]. As shown in Fig. 20A, the model exhibits multistability similar to that in Fig. 19. Additionally, Tanaka and Ayogi have studied the effect of having, at the same time, both all 2-and all 3-body interactions, with respective coupling strength K 1 and K 2 :

θi = ω i + K 1 N N j=1 sin(θ j -θ i ) + 2K 2 N 2 N j=1 N k=1 sin(θ j -θ i ) cos(θ k -θ i ). (45)
In our language this means considering all possible 2-simplices. The phase diagram of this more general model is reported in Fig. 20B and shows the existence of different regimes, many of them exhibiting multiple coexisting stable states. For example, in the region indicated as "Bistable", both the incoherent state with R ≈ 0 and the synchronized state with R ≈ 1 are stable.

In a second study, Skardal and Arenas added two layers of complexity to the previous models: (i ) a combination of interactions of different orders up to four-body interactions,(ii ) a microscopic description of such interactions in the form of a simplicial complex [START_REF] Per | Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching[END_REF]. They showed numerically that higher-order interactions were sufficient to induce an explosive transition from incoherence to synchronization in a real-world higher-order system. In practice, they have used a Macaque brain data set with 248 nodes and pairwise connections in which any 3-node clique was promoted into a 2-simplex, and any 4-node clique into a 3-simplex. We refer to simplicial complexes constructed this way as "maximal", because from a ij all possible q-simplices are constructed. A maximal simplicial complex cannot thus have, e.g. any empty triangle (three 1-simplices), but only filled triangles (three 1-simplices and one 2-simplex). The resulting network has 1-, 2-, and 3-simplex interactions, with the 2-simplex interactions term for oscillator θ i written as

K 2 2!⟨k (2) ⟩ N j=1 N k=1 a ijk sin(2θ j -θ k -θ i ), (46)
and where the 1-and 3-simplex interaction terms have similar structure. Note the choice of an asymmetrical coupling function in Eq. ( 46) which is different from the symmetrical choice in Eq. ( 43). This will be discussed in more details in the next paragraph. Here, A = {a ijk } denotes the 2-simplex interaction tensor with b ijk equal to 1 if there is a three-body interaction among oscillators i,j and k, and 0 otherwise. The ⟨k (2) ⟩ represents the average degree of 2-simplex degree, i.e. the average number of distinct 2-simplices nodes are part of. In general, the average q-simplex degree is written ⟨k (q) ⟩, and the coupling coefficient K q is rescaled by q!⟨k (q) ⟩. The complexity of the model makes it hardly tractable analytically. However, by means of self-consistency arguments similar to those used in Ref. [START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF], the authors were able to obtain a closed equation for the order parameter R 1 in a simplified all-to-all version of the model. They obtained the bifurcation diagram reported in Fig. 21, which shows the following two main findings. Firstly, higher-order interaction are able to induce an abrupt transition from incoherence to synchronization. Indeed, above a critical value of K 2+3 = K 2 + K 3 = 2, the system becomes bistable and exhibits a hysteresis cycle, yielding abrupt transitions. Since the incoherent and synchronized states have been linked to resting and active states, respectively, such abrupt transitions provide a potential mechanism for fast switching between brain states. Second, strong enough higher-order interactions (large enough values of K 2+3 ) can stabilise the synchronized state even when the 1-simplex interactions are repulsive, i.e. when K 1 < 0. Notice that explosive synchronization was first observed in global coupling with evenly spaced frenquencies [START_REF] Pazó | Thermodynamic limit of the first-order phase transition in the Kuramoto model[END_REF] and then in scale-free networks with frequency-degree correlations [START_REF] Gómez-Gardenes | Explosive synchronization transitions in scalefree networks[END_REF]. Several other structural or dynamical ingredients have then been identified that can also lead to explosive synchronization, such as multilayer couplings [START_REF] Nicosia | Collective phenomena emerging from the interactions between dynamical processes in multiplex networks[END_REF] or time delays [START_REF] Raissa | Explosive phenomena in complex networks[END_REF]. Here, Skardal and Arenas have been able to show that higherorder interactions are sufficient to induce explosive synchronization. Explosive synchronization and chimera states have also been studied in simplicial complexes by Berec in Refs. [START_REF] Berec | Chimera state and route to explosive synchronization[END_REF][START_REF] Berec | Explosive synchronization in clustered scale-free networks: Revealing the existence of chimera state[END_REF]. The choice of coupling function is known to affect the dynamics of coupled dynamical systems [START_REF] Stankovski | Coupling functions in networks of oscillators[END_REF]. In coupled oscillators, a typical choice at order 1 is the sinusoidal function sin(θ j -θ i ) that vanishes when oscillators are synchronized and that is 2π-periodic in its phases, as in the Kuramoto model of Eq. [START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF]. For interactions of more than two oscillators, however, there are more choices of functions that satisfy those requirements. Indeed, even if we restrict ourselves to the simplest case, i.e. 2π-periodic sinusoids with no harmonics and no phase-shift, we are faced with two possibilities for the functional form accounting for three-body interactions in the equation for oscillator i, namely sin(θ j + θ k -2θ i ), or sin(2θ j -θ k -θ i ). The first choice was used for example in Eq. ( 43). This function is the natural generalization of the pairwise function above, in that it is symmetric in i, meaning that it is invariant under any permutation of the other indices. This choice was also made in Ref. [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF] where it was generalized to all possible orders. The second choice, which was used for example in Eq. ( 46), is asymmetric, in the sense described above. It can, however, arise naturally from the phase reduction of nonlinear oscillators, see for example Eq. ( 52) and Refs. [START_REF] León | Phase reduction beyond the first order: The case of the mean-field complex Ginzburg-Landau equation[END_REF]. For coupling functions of larger numbers of oscillators, there is always one symmetric choice, but the number of asymmetric choices increases. However, to the best of our knowledge, the implications of the precise choice of higher-order coupling functions on the dynamics have not been investigated systematically as deserved so far. We hope this review will encourage works in this direction.

A radically different approach from those discussed above has been proposed by Millán et al., who have formulated a higher-order extension of the Kuramoto model in which the oscillators are placed not only on the nodes but also on the higher-order simplices, such as the links or the triangles, of a simplicial complex [START_REF] Millán | Explosive higher-order Kuramoto dynamics on simplicial complexes[END_REF]. The authors showed that the dynamics defined on q-simplices can be projected, through Hodge decomposition (also see Sec. III E 2), on the dynamics defined on (q-1) and (q+1) dimensional simplices. This means, for instance, that the dynamics on edges can be projected on nodes and triangles. Interestingly, when the two projected dynamics on (q -1)-and (q + 1)-simplices are adaptively coupled the transition to synchronization is explosive, while it is continuous in the uncoupled case. This implies for instance that a dynamics defined on links can induce a simultaneous explosive synchronization on the dynamics projected on nodes and triangles. The phenomenon is illustrated in Fig. 22, which reports the results of numerical simulations on a simplicial complex generated by a configuration model (see Sec. IV).

The three authors of Ref. [START_REF] Millán | Explosive higher-order Kuramoto dynamics on simplicial complexes[END_REF] have also studied synchronization in so-called Complex Network Manifolds (CNMs), which are growing simplicial complexes of dimension d, i.e. built with d-simplices [START_REF] Ana P Millán | Synchronization in network geometries with finite spectral dimension[END_REF][START_REF] Millán | Complex network geometry and frustrated synchronization[END_REF] (see Section IV B 4). Note that simplicial complexes were only used here to construct the adjacency matrix {a ij } of networks with an easily tunable spectral dimension, in addition to being small-world and having a highly modular structure. Indeed the goal of these studies was to study the effect of the spectral dimension of the underlying graph on network synchronization. The spectral dimension of a graph describes the power-law scaling of the eigenvalue density of the standard Laplacian L. Most complex networks have a spectral gap, i.e. the second eigenvalue λ 2 of the standard Laplacian L does not tend to zero as the size of the network is increased. In CNMs, however, λ 2 does tend to zero, so that a spectral dimension d S of the network can be defined. Remarkably, in CNMs, the eigenvalue density scales roughly with the dimension d of the simplicial complex, d S ≃ d. Hence, one can investigate the effect of d S just by changing the dimension of the simplicial complex used to construct the network. In [START_REF] Millán | Complex network geometry and frustrated synchronization[END_REF], the authors have reported the observation of frustrated synchronization, a dynamical regime in which the order parameter is non-stationary and exhibits large fluctuations even at large times. In [START_REF] Ana P Millán | Synchronization in network geometries with finite spectral dimension[END_REF], they have further shown via a linear approximation that the synchronized state is thermodynamically stable only in networks with d S > 4. In other words, for smaller spectral dimensions, the average FIG. 22. Explosive synchronization in the higher-order Kuramoto model. In Ref. [START_REF] Millán | Explosive higher-order Kuramoto dynamics on simplicial complexes[END_REF], the oscillators are associated not to the nodes, but to the q-simplices (with q ≥ 1) of a simplicial complex. R [+] and R [-] denote the order parameter of the dynamics projected on (q -1)-and (q + 1)-simplices, respectively shown in (A) and (B). The model has been implemented on simplicial complexes constructed by a configuration model (see Sec. IV). When the projections are uncoupled the transition is continuous, while when the projections are adaptively coupled, the transition is explosive. Figures adapted from Ref. [START_REF] Millán | Explosive higher-order Kuramoto dynamics on simplicial complexes[END_REF].

fluctuations of the phases diverge as the network size N → ∞. Hence, frustrated synchronization is only possible for d S < 4. Additionally, d S > 4 is a necessary condition for a stable synchronized state in the thermodynamic limit, as also confirmed numerically.

Higher-order interactions can yield interesting dynamics even when the oscillators have identical frequencies, as shown by two very recent studies [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF][START_REF] Chris | Low-dimensional dynamics for higher-order harmonic, globally coupled phaseoscillator ensembles[END_REF]. In the first of these works [START_REF] Chris | Low-dimensional dynamics for higher-order harmonic, globally coupled phaseoscillator ensembles[END_REF], Gong and Pikovsky have considered the following sytem of all-to-all coupled oscillators with identical frequencies and higher-order harmonics:

θ i = ω(t) + Im[H(t)e -iqθj ], (47)
with pure harmonics of order q ≥ 2. The quantity H(t) in the equations represents the coupling and depends on the generalized complex order parameters Z q (t) = R q (t)e iΦq(t) = 1 N ∑ N j=1 e iqθj (t) . The model reduces to the original Kuramoto model in Eq. ( 40) when H = Z 1 and only the first harmonic q = 1 is considered. With H = Z 2 and only the second order harmonic q = 2, one obtains a coupling function of the type sin(2(θ j -θ i )). This does not imply higher-order interactions, which can instead be obtained by considering nonlinear meanfield couplings, i.e. powers of Z q . For example, by taking H = Z 2 1 and q = 2, one recovers the system in Eq. ( 43) with pure three-body interactions. Higher-order harmonics and higher-order interactions are linked in that they both allow q-cluster states at order q, for example. Equation ( 44) can also be seen as driven by the meanfield with a second order harmonic. In their work, the authors extend the Watanabe-Strogatz theory to account for any pure higher-order harmonics, q ≥ 2, for a general form of H that can include higher-order interactions. The Watanabe-Strogatz theory provides a lower-dimensional description of all-to-all coupled oscillators with identical frequencies [START_REF] Watanabe | Integrability of a globally coupled oscillator array[END_REF][START_REF] Watanabe | Constants of motion for superconducting Josephson arrays[END_REF], similarly to the Ott-Antonsen theory for distributed frequencies [START_REF] Ott | Low dimensional behavior of large systems of globally coupled oscillators[END_REF]. As an example, Gong and Pikovsky have applied their theory to the cases of pure 3-body and pure 5-body interactions, and have been able to study the basin of attractions of the 3and 5-cluster states, respectively. It is worth mentioning here three other earlier but related studies by Pikovsky and coworkers [START_REF] Rosenblum | Self-organized quasiperiodicity in oscillator ensembles with global nonlinear coupling[END_REF][START_REF] Pikovsky | Self-organized partially synchronous dynamics in populations of nonlinearly coupled oscillators[END_REF][START_REF] Burylko | Desynchronization transitions in nonlinearly coupled phase oscillators[END_REF]. In Refs. [START_REF] Rosenblum | Self-organized quasiperiodicity in oscillator ensembles with global nonlinear coupling[END_REF][START_REF] Pikovsky | Self-organized partially synchronous dynamics in populations of nonlinearly coupled oscillators[END_REF], had already considered the effect of nonlinear mean field coupling, i.e. where H is a function of powers of Z 1 , as opposed to only the first power as in the Kuramoto model [START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF]. The authors found that this additional nonlinearity yields richer dynamics, including self-organized quasiperiodic behavior. Similarly, in Ref. [START_REF] Burylko | Desynchronization transitions in nonlinearly coupled phase oscillators[END_REF], the authors consider coupling functions that depend nonlinearly on R 1 .

In the second of these works [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF], Lucas et al. have focused directly on higher-order interactions rather than harmonics, and proposed a natural generalization of the usual Laplacian formalism to account for complex topologies (instead of all-to-all) and with a mix of orders. They introduced a multi-order Laplacian and applied it to simplicial complexes (though the formalism is valid for hypergraphs in general) of identical phase oscillators. This Laplacian allows to assess the stability of the fully synchronized state θ i (t) = θ S (t) = ωt for all i. Formally, the authors considered FIG. 23. Higher-order oscillator model of Ref. [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF] in the case of all-to-all higher-order interactions. The higher the order of interactions taken into account, the more stable the synchronized state. Convergence of N = 100 oscillators with (A) only 1-simplex interactions and (B) only 2-simplex interactions. Convergence is faster in the second case. (C) This is confirmed by the analytical first non-zero Lyapunov exponent at each order q, which is proportional to q. Here, it is plotted against N . (D) Multi-order Lyapunov exponent more negative as qmax is increased. Figures reproduced from Ref. [START_REF] Lucas | A multi-order Laplacian for synchronization in higher-order networks[END_REF].

Higher-order interactions from phase reduction

Real-life oscillators are often nonlinear, and their dynamics is more complex than that of a simple phase oscillator. However, one can obtain phase models that approximate the original dynamics by using phase reduction techniques [START_REF] Nakao | Phase reduction approach to synchronisation of nonlinear oscillators[END_REF][START_REF] Pietras | Network dynamics of coupled oscillators and phase reduction techniques[END_REF]. This makes phase models very powerful since they can capture the dynamics of networks of general nonlinear oscillators, as long as they are weakly coupled. For example, the Kuramoto-Sakaguchi model can obtained via a phase reduction of the mean-field complex Ginzburg-Landau equations [START_REF] León | Phase reduction beyond the first order: The case of the mean-field complex Ginzburg-Landau equation[END_REF]. The Kuramoto-Sakaguchi model is an extension of the original Kuramoto model obtained by the addition of a phase shift α in the coupling function sin(θ j -θ i + α) in Eq. [START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF]. However, the Kuramoto-Sakaguchi model is still a first-order phase approximation in the weak coupling parameter limit, and it only displays full incoherence or synchronization (see Refs. [START_REF] Watanabe | Integrability of a globally coupled oscillator array[END_REF][START_REF] Watanabe | Constants of motion for superconducting Josephson arrays[END_REF] for the case of identical oscillators). Other nontrivial dynamics such as chaos, cluster states, or weak chimeras, have only been observed by introducing different symmetries or more harmonics in the coupling function [START_REF] Peter Ashwin | Identical phase oscillator networks: Bifurcations, symmetry and reversibility for generalized coupling[END_REF]. Ashwin et al. have noted ahead of time that, even though adding harmonics does unfold degeneracies, there might be some that will only unfold by considering non-pairwise interactions [START_REF] Peter Ashwin | Identical phase oscillator networks: Bifurcations, symmetry and reversibility for generalized coupling[END_REF]. More recent results indicate, however, that many-body interactions emerge naturally when considering phase reductions including higher-orders terms in the weak coupling parameter [START_REF] Ashwin | Hopf normal form with S N symmetry and reduction to systems of nonlinearly coupled phase oscillators[END_REF][START_REF] León | Phase reduction beyond the first order: The case of the mean-field complex Ginzburg-Landau equation[END_REF][START_REF] Matthew H Matheny | Exotic states in a simple network of nanoelectromechanical oscillators[END_REF]. Moreover, these studies show that the inclusion of higher-order terms unlock nontrivial dynamical regimes as well as transitions between them. In this section, we will only review studies approaching phase reduction of higher-order networks of oscillators from a theoretical point of view. Section VI C will then be complementary to this section, as phase reduction will there be approached from the inverse-problem point of view of network inference.

Ashwin, Bick, Rodrigues, and coworkers have produced a series of important contributions for phase reduction of populations of identical oscillators [START_REF] Ashwin | Hopf normal form with S N symmetry and reduction to systems of nonlinearly coupled phase oscillators[END_REF][START_REF] Bick | Chaos in generically coupled phase oscillator networks with nonpairwise interactions[END_REF][START_REF] Bick | Heteroclinic switching between chimeras[END_REF][START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Heteroclinic cycles for small populations[END_REF][START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Stability of heteroclinic cycles and networks[END_REF]. The authors of Ref. [START_REF] Peter Ashwin | Identical phase oscillator networks: Bifurcations, symmetry and reversibility for generalized coupling[END_REF] have suggested that interactions beyond pairwise might be the only way to unfold some degeneracies and unlock nontrivial dynamics [START_REF] Peter Ashwin | Identical phase oscillator networks: Bifurcations, symmetry and reversibility for generalized coupling[END_REF]. In a paper published in the same year [START_REF] Ashwin | Hopf normal form with S N symmetry and reduction to systems of nonlinearly coupled phase oscillators[END_REF], Aswhin and Rodrigues have shown that the application of phase reduction to a systems of generic nonlinear identical systems with global symmetric coupling yields the Kuramoto-Sakaguchi at the lowest order, but at the next order, terms including 2-, 3-, and 4-body interactions naturally emerge:

θi = Ω(θ, ) + N N j=1 g 2 (θ j -θ i ) + N 2 N j,k=1 g 3 (θ j + θ k -2θ i ) + N 2 N j,k=1 g 4 (2θ j + θ k -θ i ) + N 3 N j,k,l=1 g 5 (θ j + θ k -θ l -θ i ) (52)
The inclusion of such terms allows for a wider range of dynamical behaviors such as cluster states, and predictions that are valid for longer timescales. Moreover, the authors have been able to demonstrate that non-pairwise interactions yield multistability via the coexistence of many two-cluster states, with varying cluster size, just as in Refs. [START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF][START_REF] Tanaka | Multistable attractors in a network of phase oscillators with three-body interactions[END_REF].

Here, the many-body interactions terms are traced back to cubic nonlinearities in the original nonlinear system. Bick et al. have further investigated the dynamics of the phase reduced system of Eq. ( 52), looking in particular for the possibility of chaos in small networks [START_REF] Bick | Chaos in generically coupled phase oscillator networks with nonpairwise interactions[END_REF]. Previously, it was thought that for populations of identical oscillators, higher harmonics in the coupling functions, or nontrivial amplitude dynamics, were necessary to observe chaos in small networks (N = 4 is smallest theoretical size to exhibit chaos). In fact, for pure pairwise interactions, for N = 4, the only known coupling function to yield chaos has a minimum of four nontrivial harmonics (for larger networks, less harmonics are needed) [START_REF] Bick | Chaotic weak chimeras and their persistence in coupled populations of phase oscillators[END_REF]. Remarkably, the authors of Ref. [START_REF] Bick | Chaos in generically coupled phase oscillator networks with nonpairwise interactions[END_REF] were able to show that two nontrivial harmonics are sufficient to see chaos, even in the case N = 4, when many-body interactions are considered. In the last two years, Bick and coworkers have produced three more pieces of work in the same direction, focusing in particular on heteroclinic cycles [START_REF] Bick | Heteroclinic switching between chimeras[END_REF][START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Heteroclinic cycles for small populations[END_REF][START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Stability of heteroclinic cycles and networks[END_REF]. In the first paper Bick has considered M populations of N oscillators each, with pairwise interaction between oscillators in the same population, and non-pairwise interactions among oscillators of different populations [START_REF] Bick | Heteroclinic switching between chimeras[END_REF]. This setup builds on a previous work by Komarov and Pikovsky who considered populations of oscillators with distinct frequency and focused on a specific three-population resonance [START_REF] Komarov | Dynamics of multifrequency oscillator communities[END_REF]. In Bick's setup, all oscillators have identical frequencies, and it is the presence of nonpairwise interactions that yields the heteroclinic connections joining the weak chimeras. Indeed, as shown in Fig. 24 switching between states of so-called localized frequency synchrony were observed [START_REF] Bick | Heteroclinic switching between chimeras[END_REF]. Bick has further built on that paper to formally prove the existence of those heteroclinic cycles in Ref. [START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Heteroclinic cycles for small populations[END_REF], and finally to assess their stability together with Lohse in Ref. [START_REF] Bick | Heteroclinic dynamics of localized frequency synchrony: Stability of heteroclinic cycles and networks[END_REF].

More recently, León and Pazó have produced a very thorough study of the higher-order phase reduction of the meanfield complex Ginzburg-Landau equation (MF-CGLE) [START_REF] León | Phase reduction beyond the first order: The case of the mean-field complex Ginzburg-Landau equation[END_REF]. To date, the phase reduction of MF-CGLE was only known up to the first order, and produces the standard Kuramoto model of Eq. ( 40). The Kuramoto model exhibits two dynamical regimes only, synchronization and incoherence, but is unable to reproduce more exotic regimes of the MF-CGLE, such as quasiperiodic partial synchronization and cluster states. To remedy that, the two authors have proposed a isocron-based phase reduction method up to the second and third order. Crucially, the authors demonstrate the accuracy of their technique by showing that the obtained phase model does exhibit the exotic dynamics of the weakly coupled MF-CGLE. [START_REF] Matthew H Matheny | Exotic states in a simple network of nanoelectromechanical oscillators[END_REF]. They have performed experiments with a ring of eight nano-electromechanical nonlinear oscillators, and have observed exotic and complex dynamics including weak chimeras, decoupled states, traveling waves, and inhomogeneous synchronized states. Then, they have obtained a phase approximation of their initial nearest-neighbor (i.e. pairwise interactions) network of so-called saturated oscillators, up to the second order in the coupling strength. As in the other studies, terms with three-body interactions naturally emerged in the phase description, with the addition of next-nearest neighbor and biharmonic terms as illustrated in Fig. 25. The strength of their phase model is that it is able to qualitatively reproduce all the complex dynamics regimes observed both in the experiments and in the initial nonlinear model.

Finally, Matheny et al. have published a very complete study combining experiments, numerics, and analytics

In conclusion, phase reduction naturally yields higher-order interactions between the phases. Progress in analytical phase reduction up to higher-order can potentially helps us understand the exotic and complex dynamics of network of general nonlinear oscillators, which cannot be captured by first-order phase models. Moreover, it will certainly be helpful in the future to the network inference area presented in Sec. VI C. Finally, it is also worth mentioning that some efforts has been made to compute phase reductions numerically, when no analytical derivation is available [START_REF] Rosenblum | Numerical phase reduction beyond the first order approximation[END_REF].

FIG. 25. Ring of eight nano-electromechanical nonlinear oscillators from Ref. [START_REF] Matthew H Matheny | Exotic states in a simple network of nanoelectromechanical oscillators[END_REF]. The solid black lines represent physical connections between the oscillators. Dashed and dotted lines represent effective higher-order coupling that appear in the phase reduced model. This systems exotic complex dynamics. Figure reproduced from Ref. [START_REF] Matthew H Matheny | Exotic states in a simple network of nanoelectromechanical oscillators[END_REF].

B. Nonlinear oscillators

Chaotic oscillators

When chaotic oscillators are coupled, they can synchronize in various ways. The study of chaotic synchronization started with two seminal papers published in the 90s [START_REF] Louis | Synchronization in chaotic systems[END_REF][START_REF] Michael G Rosenblum | Phase synchronization of chaotic oscillators[END_REF]. In the first of these works, Pecora and Carroll discovered the phenomenon of complete synchronization, a regime in which coupled chaotic oscillators converge to an identical state and evolve with the same trajectory [START_REF] Louis | Synchronization in chaotic systems[END_REF]. Then, Rosenblum, Pikovsky and Kurths, showed that chaotic oscillators can phase synchronize, while their amplitudes vary chaotically and are uncorrelated [START_REF] Michael G Rosenblum | Phase synchronization of chaotic oscillators[END_REF]. The richness of the dynamics of chaotic oscillators allows for more complex behaviors in networked systems than those observed with phase oscillators, and has been the object of interest in the scientific community [START_REF] Pikovsky | Synchronization: A Universal Concept in Nonlinear Sciences[END_REF]. However, all the studies on chaotic synchronization, with very few exceptions [START_REF] Chai | Synchronization in arrays of chaotic circuits coupled via hypergraphs: Static and dynamic coupling[END_REF][START_REF] Krawiecki | Chaotic synchronization on complex hypergraphs[END_REF][START_REF] Lv Gambuzza | The master stability function for synchronization in simplicial complexes[END_REF], have considered pairwise interactions. We will therefore start our discussion of high-order effects with a series of studies related to network motifs.

In Ref. [START_REF] Lodato | Synchronization properties of network motifs[END_REF] Lodato et al. have investigated whether there can be an underlying dynamical reason to explain the existence of network motifs. In particular they have focused on synchronization and have evaluated analytically the stability of the synchronous state in all directed and undirected 3-and 4-node graphs of chaotic oscillators. They have then compared the results with the known abundance of these small graphs as subgraphs (motifs) of real biological systems. Interestingly, the authors were able to show that 3-and 4-node graphs exhibiting more stable synchronous states in general coincide with network motifs preserved across evolution, while the bifan motif, one of the three most relevant biological motifs [START_REF] Alon | Network motifs: Theory and experimental approaches[END_REF], was not compatible with synchronization for any type of chaotic dynamics. In another study [START_REF] Miguel | Synchronization in simple network motifs with negligible correlation and mutual information measures[END_REF], Soriano et al. have investigated the link between generalized synchronization and correlation between the oscillators present in a motif, remarkably showing that it is possible to construct small graphs of oscillators that synchronize but at the same time do not exhibit correlations. This result, important for network inference, stresses how indirect connections might be systematically underestimated. Finally, it is worth mentioning here one more study on motifs [START_REF] Krishnagopal | Synchronization patterns: From network motifs to hierarchical networks[END_REF]. Although the oscillators considered were not chaotic, a fractal topology was used. The authors were able to analytically compute the stability of various dynamical regimes. As an example, they showed that oscillation death was possible in that setting, even with a symmetric coupling function.

We continue with four studies of synchronization in bipartite setups representing two types of populations of oscillators, with inter-population links. The first study considered a complete bipartite network of nonlinear maps (chaotic or periodic) [START_REF] Re Amritkar | Synchronized clusters in coupled map networks. II. Stability analysis[END_REF]. The existence and stability of synchronization and cluster synchronization was assessed via Lyapunov exponents through the Master Stability Function (MSF) formalism [START_REF] Boccaletti | Complex networks : Structure and dynamics[END_REF][START_REF] Barahona | Synchronization in small-world systems[END_REF][START_REF] Louis | Master stability functions for synchronized coupled systems[END_REF]. Similarly, the second study investigated chaotic synchronization in coupled Bernoulli maps by using the same formalism [START_REF] Englert | Synchronization of chaotic networks with time-delayed couplings: An analytic study[END_REF]. The bipartite setting was one of the settings investigated, and the study concluded that synchronization was not possible in that setting. In the third study [START_REF] Sorrentino | Network synchronization of groups[END_REF], Sorrentino and Ott used a bipartite setting as a special case of multiple interacting populations of oscillators. The authors found that adding intra-population links could enhance the stability of socalled multisynchronous states. Finally, bipartite networks (together with random and tree-like networks) were one of three settings in which Pecora et al. showed the possibility for cluster synchronization and so-called isolated desynchronization [START_REF] Louis M Pecora | Cluster synchronization and isolated desynchronization in complex networks with symmetries[END_REF]. The latter is a dynamical regime in which one or more clusters desynchronize while the other clusters remain synchronized.

It was as early as 1998 that the synchronization of coupled chaotic circuits was studied by Wu on hypergraphs [START_REF] Chai | Synchronization in arrays of chaotic circuits coupled via hypergraphs: Static and dynamic coupling[END_REF]. The system under consideration consisted of indentical chaotic circuits (the nodes of the hyphergraph) coupled via multi-terminal resistance-devices, effectively yielding multi-circuit interactions (the hyperlinks). For the sake of mathematically tractability the author restricted his study to a case with only triplet interactions. By looking at the algebraic connectivity of the hypergraph, defined as the smallest nonzero eigenvalue of the hypergraph Laplacian, he was then able to derive sufficient conditions for the complete synchronization of the circuits. Indeed, a large algebraic connectivity and linear but passive coupling were required to yield synchronization. Note that all computations rely on the hypergraph structure, even if the system was represented as a bipartite network in the figures of the original paper. A more recent study by Krawiecki has gone much further in complexity [START_REF] Krawiecki | Chaotic synchronization on complex hypergraphs[END_REF]. In particular, the author has considered a system of identical chaotic (Lorenz) oscillators placed on the nodes of scale-free q-hypergraphs (with q ≥ 2), i.e. hypergraphs that exhibits only (q -1)-simplex interactions, i.e. in which each hyperedge connect exactly q nodes, and the number of hyperedges attached to a node follows a power-law distribution. He found out that a state of complete synchronization can be achieved and coexists with a state of oscillation death [START_REF] Koseska | Oscillation quenching mechanisms: Amplitude vs. oscillation death[END_REF]. Remarkably, the traditional Master Stability Function formalism was generalized to hypergraphs so as to investigate the stability of the complete synchronization state. Furthermore, the study has reported the existence of other dynamical regimes such as partial anti-synchronization.

In another study [START_REF] Wu | Synchronization of an evolving complex hyper-network[END_REF], Wu et al. have derived analytical criteria for the synchronization of Chua oscillators in q-hypergraphs. The hypergraphs have a power law distribution of hyperdegrees such that when q = 2, the structure reduces to that of a Barabási-Albert network. Recently, Mulas et al. [START_REF] Mulas | Coupled dynamics on hypergraphs: Master stability of steady states and synchronization[END_REF] used the Master Stability formalism to derive stability criteria in coupled nonlinear oscillators on hypergraphs with the particularity that they are directed.

Finally, very recently, Gambuzza et al. [START_REF] Lv Gambuzza | The master stability function for synchronization in simplicial complexes[END_REF] have generalized the Master Stability Function formalism to the most general case of simplicial complexes. They have considered a system of N dynamical units, which are placed on the nodes of a simplicial complex of any dimension q max and can be involved in q-simplex interactions, with q = 1, 2, . . . , q max , as described by the structure of the simplicial complex. The equations of motion of the system read:

ẋi = f (x i ) + σ 1 ∑ N j1=1 a (1) ij1 g (1) (x i , x j1 ) + σ 2 ∑ N j1=1 ∑ N j2=1 a (2) ij1j2 g (2) (x i , x j1 , x j2 ) + . . . +σ qmax ∑ N j1=1 ... ∑ N jq max =1 a (qmax) ij1....jq max g (qmax) (x i , x j1 , ..., x jq max ), (53)
where

x i ≡ x i (t)
is the m-dimensional vector describing the state of node (dynamical unit) i at time t, the real valued parameters σ 1 , ..., σ qmax tune the strength of the interactions at the different orders q = 1, ..., q max , and a (q) ij1...jq are the entries of the adjacency tensor A (q) representing the structure of the simplicial complex. Furthermore, f ∶ R m → R m is the most general function describing the local dynamics, which is assumed to be identical for all units, while g (q) ∶ R (q+1)×m → R m , with q = 1, ...., q max , are the functions governing the interaction forms at different orders. The authors have been able to study analytically the stability of the complete synchronized state x i (t) = x S (t) ∀i, under the only assumption that the coupling functions are synchronization non-invasive, i.e. that g (q) (x S , x S , ..., x S ) ≡ 0 ∀q. Based on a set of Laplacian matrices similar to those in Eq. ( 49), they have derived a Master Stability Function with the negativity of the maximum Lyapunov exponent as the stability criterion. The method has been illustrated on simplicial complexes of coupled chaotic oscillators, such as Rössler and Lorenz dynamical systems, with both pairwise and triplet interactions. When nonlinear oscillators are coupled, the Lyapunov exponents depend nonlinearly on the eigenvalues of the Laplacian of the system. Hence, it is possible to have bounded regions of the parameter space where synchronization is stable, as defined by a negative maximum Lyapunov exponent. The authors have investigate how the region of stability depends on the structure of the simplicial complex and on the coupling functions. Figure 26 show an example of coupling functions for which the region of synchronization is respectivey bounded (panel (A)) and unbounded (panels (B) and (C)), for a given node dynamics and structure of the simplicial complex. This framework will hopefully be used in further studies along those lines, for various oscillators, topologies, and coupling functions.

Neuron models

The brain provides a very rich and important terrain to study synchronization of neurons with higher-order interactions. However, so far, little is known about synchronization of neuron models in higher-order networks from the theoretical side. In the theoretical study of neuronal networks, various oscillators models are used to represent neurons, depending on the context and the goals of the modeler [START_REF] Dayan | Theoretical neuroscience: Computational and mathematical modeling of neural systems[END_REF][START_REF] Gerstner | Spiking Neuron Models: Single Neurons, Populations, Plasticity[END_REF]. Historically, the most famous model is that of Hodgkin and Huxley, dating back from 1952 and for which they won a Nobel Prize in Physiology or Medicine. Their model describes how the neurons spike, and consists of a set of nonlinear differential equations for the membrane potential. Others models such as neural mass models have been developed since and have been used successfully to understand synchronization phenomena in the brain. Here, we report the different higher-order settings in which synchronization of neuron models has been carried out. We start with a bipartite setting that was investigated in [START_REF] Bian | Adaptive synchronization of bipartite dynamical networks with distributed delays and nonlinear derivative coupling[END_REF]. Here the authors use that setting as a mean to study the interactions between two populations of neurons, and in fact study two coupled bipartite networks. The authors concluded, by analytical and numerical calculations, that the two networks can be synchronized with the help of adaptive feedback.

To the best of our knowledge, three studies have considered synchronization in motifs of neurons [START_REF] Shilnikov | Polyrhythmic synchronization in bursting networking motifs[END_REF][START_REF] Matias | Anticipated synchronization in a biologically plausible model of neuronal motifs[END_REF][START_REF] Gollo | Mechanisms of zero-lag synchronization in cortical motifs[END_REF]. Shilnikov and collaborators [START_REF] Shilnikov | Polyrhythmic synchronization in bursting networking motifs[END_REF] provide a detailed analysis of synchronization in motifs of both inhibitory and excitatory, and inhibitory-only neurons, see for example Fig. 27. The authors showed that the neurons can self-organize to designate the pacemaker among them by shortening the burst duration of the (secondary) driven neuron. This effect hold in inhibitory-only motifs, but the synchronous patterns can coexist with asynchronous patterns. The authors show that the addition of excitatory links ensure synchronous patterns of bursting. Finally, the inhibitory-only motifs exhibited multistability with as much as eight coexisting attractors. The authors suggest these attractors could be associated with patterns known to control certain animal and human locomotion activities.

In the second study [START_REF] Matias | Anticipated synchronization in a biologically plausible model of neuronal motifs[END_REF], stable so-called anticipated synchronization was shown to exist in biologically plausible 3-neuron motifs including inhibitory and excitatory synapses with time delays. All parameters have a clear biological interpretation, and the authors identified a transition from delayed synchronization to anticipated synchronization when synaptic conductances are increased withing physiological ranges.

In the third study [START_REF] Gollo | Mechanisms of zero-lag synchronization in cortical motifs[END_REF], Gollo et al. identified a mechanism by which zero-lag synchronization is facilitated. Zero-lag synchronization is of widely accepted importance in brain studies. Indeed, experimental evidence shows zero-lag synchronization between distant regions of the brains. A mechanism called "dynamical relaying", related to a specific motif, was proposed to account for such phenomenon in the presence of conductance delays. However, Gollo and coworkers showed that the motif was not always a reliable condition for zero-lag synchronization. Instead, they narrowed down a "resonance pair" of reciprocally connected neurons, which ensures zero-lag synchronization. They did so by systematically analyzing synchronization in small network motifs of Hodgkin-Huxley, neural mass, and Izhikevich neurons.

Finally the few studies that considered synchronization in larger networks of neurons relied either on numerics or phase reduction techniques, such as [START_REF] Tanaka | Multistable attractors in a network of phase oscillators with three-body interactions[END_REF], and were described in the corresponding sections above. For more applied studies on the higher-order structure of brain networks in neuroscience, see Sec. IX B.

C. Inference of nonpairwise interactions in coupled oscillators

In networks of coupled dynamical units, the standard approach is to fix the structure of the network and to study how the system evolves. However, when modeling real oscillatory networks, we very often have to face the so-called inverse-problem too: can we reconstruct the underlying network structure by just looking at the dynamical evolution of the system? This is a problem with relevant applications. In neuroscience, for example, one wants to infer the brain neuronal network from EEG data, i.e. times series of the electrical activity of neurons or cortical areas. This task, known as network inference, is highly non trivial, and three main approaches have been proposed in the literature to reconstruct directional pairwise interactions based on information theory [START_REF] Dmitry | Detection of weak directional coupling: Phase-Dynamics approach versus state-space approach[END_REF], state-space approaches [START_REF] Frenzel | Partial Mutual Information for Coupling Analysis of Multivariate Time Series[END_REF], and phase dynamics [START_REF] Michael | Detecting direction of coupling in interacting oscillators[END_REF]. Here, we report on the few studies that have addressed the inference of higher-order interactions, i.e. of interactions between three or more oscillators, based on the third approach using phase dynamics.

Following [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF], let us start by considering the general system of N coupled dynamical systems:

ẋi = G i (x i ) + H i (x 1 , . . . , x N ), (54)
with i = 1, . . . , N , where function G i determines the local (uncoupled) dynamics of oscillator i, is the coupling strength, and H i is the function describing the structural coupling. It is assumed that the G i are such that each uncoupled oscillator has a stable limit cycle, which can be parametrized by a phase θ k . The structural couplings are directed physical couplings, e.g. synapses in the case of neurons. If H i does not depend on x k , we say there is no structural coupling from k to i. In general, H i can contain terms of pairwise coupling, H ij (x i , x j ), triplet couplings, H ijk (x i , x j , x k ), or coupling between any larger numbers of oscillators. For example, one can write H i = ∑ j H ij (x i , x j ), if only pairwise interactions are present in the network. In the case of weak coupling, i.e. in the small limit, each individual limit-cycle is perturbed weakly enough so that system (54) has an attracting N -torus solution which can be written in terms of N phases θ 1 , . . . , θ N [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF] as:

θ i = ω i + h i (θ 1 , . . . , θ N ). (55)
The new coupling functions can then be written as an expansion in the small coupling parameter

h i (θ 1 , . . . , θ N ) = h (1) i (θ 1 , . . . , θ N ) + 2 h (2) i (θ 1 , . . . , θ N ) + . . . , (56)
by performing a perturbative reduction of Eq. ( 54) (see Sec. VI A 2). We refer to the couplings functions h i in system [START_REF] Sarah E Morgan | Low-dimensional morphospace of topological motifs in human fMRI brain networks[END_REF] as effective phase couplings. It is important to note that, as in Sec. VI A 2, the effective phase couplings h i differ from the original structural couplings H i . More specifically, there can be an effective phase coupling from j to i even if there is no structural coupling, but the opposite is not true. So, there are more effective links than structural links. However, if is sufficiently small, structural and effective couplings are practically identical. Indeed, the additional effective links appear only in the second-order terms h

(2)

i (θ 1 , . . . , θ N ) which is rescaled by 2 , and in the higher-order terms which scale in higher powers of .

The goal of the methods proposed in Refs. [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF][START_REF] Kralemann | Reconstructing effective phase connectivity of oscillator networks from observations[END_REF] is to reconstruct the effective coupling of the system in Eq. ( 55), including couplings beyond pairwise, starting from at least one scalar time series for each node of the original system in Eq [START_REF] Austin R Benson | Higher-order organization of complex networks[END_REF]. A situation where only a scalar time series is available for each node is common for example in neuroscience with EEG recordings, and is such cases, the information can be sufficient to reconstruct the phase system (55) but not the original system [START_REF] Austin R Benson | Higher-order organization of complex networks[END_REF]. Such a goal is achieved in two main steps: first, by reconstructing phases from the original time series, and second, by reconstructing the effective phase couplings h i from the phases. Finally, weighted directed links are extracted from the coupling functions by measuring the so-called partial norms [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF] associated to each link. Indeed, since the h i are 2π-periodic functions of N phases, they can be decomposed into a Fourier expansion for the phases. Then, the pairwise interaction from i to j is determined by the coefficients in the expansion that depend only on i and j, and it can be measured as the sum of the square of those coefficients. More specifically, in Ref. [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF] Kralemann et al. have generalized this method of spectral decomposition of the effective coupling functions from Ref. [START_REF] Kralemann | Phase dynamics of coupled oscillators reconstructed from data[END_REF] to the case of interactions among more than two oscillators. Hence, each term corresponds to a coupling among two or more oscillators, and its associated partial norm indicates its strength. The numerical method has been successfully tested on networks of size 3, 5, and 9 of van der Pol oscillators. Figure 28 shows an example of the results obtained in the case of networks with three nodes. In general, the effective links detected by the method reliably reveal the true structural links (pairwise or higher-order). However, the method also detects some additional links, as expected: some are true higher-order links of the phase description, while some others are spurious links, due to a systematic error of the method. Unfortunately, no analytical derivation of the phase reduction exists yet for these systems (see Sec. VI A 2 for other systems), so that there is no clear way to distinguish, of those additional links, which are true and which are spurious, to date. The method also successfully avoids detecting functional links. Two oscillators are said to be functionally coupled if their dynamics is correlated. Functional coupling is a concept typical of brain activity studies, and it may only be loosely related to structural and effective coupling [START_REF] Tass | Detection of n:m Phase Locking from Noisy Data: Application to Magnetoencephalography[END_REF]. [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF]. An arrow from the center to a node i indicates a directed triplet interaction from (j, k) to i. Panels (A) and (B) show two examples of the original structural network and the reconstructed one. While the inference in the first case is good, the method yields a spurious links from node c to a. Figures adapted from Ref. [START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF].

It is worth mentioning here that Rosenblum and Pikovsky have developed in parallel a numerical phase reduction beyond the first order to remedy the missing analytical derivations and complement the existing ones [START_REF] Rosenblum | Numerical phase reduction beyond the first order approximation[END_REF]. For such a method to work, the available time series data must satisfy two criteria: they must not come from a fully synchronized trajectory, and it must be of sufficient length. Indeed, to infer the coupling functions, the phases must cover the Ntorus. Hence, first, when the system is synchronized, however, the dynamics only happens on a limit-cycle, and no information can be extracted. Second, the time series must be long enough to cover the N -torus. Because of this, the method, is practically useless for large networks, as the data needed to cover a N -dimensional space rapidly grows with N . To be able to deal with networks larger than N > 3, only partial phase dynamics reconstruction is possible. Typically, one assumes pairwise interactions, and only considers the phases θ i and θ j to infer the coupling functions h ij from j to i. The idea is to do so for all pairs of oscillators, and instead of reconstructing the full system in Eq. ( 55), one only allows for pairwise links to be inferred. However, this method yields spurious effective phase links that do not exist in the full system in Eq. ( 55) or the original structural connectivity of system in Eq. ( 54).

To overcome this, Kralemann et al. have extended their previous method discussed above, and have proposed a partial triplet analysis [START_REF] Kralemann | Reconstructing effective phase connectivity of oscillator networks from observations[END_REF]. They have considered all the triplets of phases of the type θ i , θ j , θ k to reconstruct the coupling functions h ijk , h jki , h kij . From these functions, pairwise connections have been obtained from the partial norm of the spectral decomposition, as above. The authors have showed that triplet partial analysis performed better than the pairwise partial analysis in networks of 3 and 4 Van der Pol oscillators. Indeed, the true links were detected equivalently well, but the triplet partial analysis successfully avoided detection of spurious links produced instead by the pairwise analysis.

As mentioned above, all these methods need input data that do not come from synchronized trajectories. This can be checked by evaluating the usual pairwise n ∶ m synchronization index γ j,k = ⟨e i(nθj -mθ k ) ⟩ , where ⟨⋅⟩ indicates temporal averaging, and where n and m are integers [START_REF] Pikovsky | Synchronization: A Universal Concept in Nonlinear Sciences[END_REF]. This index is close to 1 if oscillators j and k are phase locked. Complete network synchronization can be checked by computing the index for all pairs of oscillators. However, triplet synchronization is not revealed by this index. Indeed, it is well possible that three phases θ i , θ j , θ k satisfy the relation nθ i + mθ j + lθ k = constant for three integers n, m, l, even though the pairwise index of each pair is not close to 1. To reveal triplet synchronization from data, the following triplet synchronization index has been introduced in Ref. [START_REF] Kralemann | Detecting triplet locking by triplet synchronization indices[END_REF]:

γ i,j,k = ⟨e i(nθi+mθj +lθ k ) ⟩ . ( 57
)
Notice that a value of γ i,j,k close to 1 is not a sufficient condition for synchronization. Indeed, it only indicates its possibility, since a large value of the index can also be the consequence of other types of interdependence between the phases. Finally, as mentioned by the same authors, the index can be readily extended to higher-order synchronization indices, valid for quandruplets and higher-resonances. Jia et al. have built on that, showing experimentally the existence of states where triplets are synchronized but pairs are not [START_REF] Jia | Experimental study of the triplet synchronization of coupled nonidentical mechanical metronomes[END_REF]. In Ref. [START_REF] Stankovski | Coupling functions in networks of oscillators[END_REF], Stankovski et al. have proposed another method to reconstruct the effective phase connectivity of a network. The specificity of their method is that it works for network of oscillators with time-varying coupling and frequencies, and that are subject to noise. The method is based on dynamical Bayesian inference [START_REF] Duggento | Dynamical Bayesian inference of time-evolving interactions: From a pair of coupled oscillators to networks of oscillators[END_REF], and detects coupled pairs, triplets, and quadruplets of oscillators. The method computes the values of a set of parameters that fully determine the couplings. The values of the parameters are inferred by making use of Bayes' theorem, which takes a prior distribution and evolves it into a posterior distribution, by using time series of the system and building a likelihood function. The authors have demonstrated the accuracy of the method on a simulated 5-oscillator network, as well as on real multi-channel EEG data. The method has been shown to outperform inference based on pairwise interactions only. Unfortunately, similarly to the other methods presented above, this method works for relatively small networks.

For applications of inference methods of higher-order interactions on real brain networks data, see Sec. IX B.

VII. SPREADING AND SOCIAL DYNAMICS

Dynamical processes that emulate human behaviors have been the focus of many studies, where social relationships and interactions are typically considered as an underlying structure. Social interactions are a natural testing ground for higher-order approaches. Since individuals can interact in pairs or groups, the dynamics should in turn account for the higher-order effects that the non-pairwise interactions might lead to. In this section, we review a broad variety of models, initially introduced and studied on graphs, that have been extended as dynamical processes on HOrSs. We start reviewing spreading processes, historically embedded within the literature of epidemics on networks [START_REF] Pastor | Epidemic spreading in scale-free networks[END_REF][START_REF] Pastor-Satorras | Epidemic processes in complex networks[END_REF], but recently revisited to fit the dynamics of social contagions [START_REF] Centola | How behavior spreads: The science of complex contagions[END_REF]. We then continue with a wider class of models of social dynamics mostly devoted to the formation of opinions and consensus [START_REF] Sen | Sociophysics: An Introduction[END_REF][START_REF] Castellano | Statistical physics of social dynamics[END_REF][START_REF] Baronchelli | The emergence of consensus: A primer[END_REF].

A. Spreading in higher-order networks

The study of spreading processes on networks is one of the branches of network science that attracted more attention among the community. Building on top of classical epidemiological compartmental models [START_REF] Ogilvy | A contribution to the mathematical theory of epidemics[END_REF][START_REF] Roy | Infectious Diseases of Humans: Dynamics and Control[END_REF][START_REF] Herbert W Hethcote | The mathematics of infectious diseases[END_REF], the recent success of these models is partially due to the increasing availability of large scale data that opened up new research avenues in which researchers make use of the newly available data sources to inform the models, which on turn allow us to forecast and possibly control the disease spreading [START_REF] Zhang | Spread of Zika virus in the Americas[END_REF][START_REF] Pastore Y Piontti | Charting the next Pandemic: Modeling Infectious Disease Spreading in the Data Science Age[END_REF][START_REF] Viboud | The future of influenza forecasts[END_REF][START_REF] Adam | Early dynamics of transmission and control of COVID-19: A mathematical modelling study[END_REF][START_REF] Moritz | The effect of human mobility and control measures on the COVID-19 epidemic in China[END_REF]. In light of these new advancements, network scientists have been slowly, but extensively, introducing more and more details into the modeling framework in order to increase its accuracy and ultimately its predictive power.

In this scenario, two of the most studied compartmental models are the Susceptible-Infected-Recovered (SIR) and the Susceptible-Infected-Susceptible (SIS). In both models, susceptible individuals (S) can get infected by mean of an interaction with infectious ones (I). This SI process always leads, by construction, to the absorbing state in which all individuals are infected. The introduction of an additional transition leads to richer phenomena. More specifically, in the case of the SIS, individuals can switch multiple times between the S and I states, eventually reaching a steady state in which the epidemic is sustained by a non-zero number of individuals. Contrarily, in the SIR, individuals gain immunity to reinfections after a certain amount of time, or with a given probability per unit time. These immune individuals are then called recovered (R) and do not participate anymore to the spreading dynamics. This type of models is therefore used when it comes to modeling infectious diseases such as Ebola, or seasonal influenza, in which individuals can acquire immunity against reinfections. As a consequence, the SIR presents also the disease-free state as an absorbing state.

Many theoretical approaches have been developed to analytically describe, with increasing level of complexity, the dynamics of epidemic spreading on complex networks. An accurate analytical description should include the interplay between the structure of the contact patterns and the dynamics of the spreading process on top. Here, instead of going through the assumptions, advantages and drawbacks of all the possible descriptions, from the mean-field (MF) and the heterogeneous mean-field (HMF), to the most accurate microscopic Markov-chain approaches, we refer the interested reader to [START_REF] Pastor-Satorras | Epidemic processes in complex networks[END_REF][START_REF] James P Gleeson | High-accuracy approximation of binary-state dynamics on networks[END_REF][START_REF] James P Gleeson | Binary-state dynamics on complex networks: Pair approximation and beyond[END_REF][START_REF] Wang | Unification of theoretical approaches for epidemic spreading on complex networks[END_REF][START_REF] István Z Kiss | Mathematics of epidemics on networks[END_REF] and references therein.

While the aforementioned models have been widely used to study the spread of diseases, there's a variety of other domains where they have been successfully applied. Indeed, another long tradition of modelers that have been using similar frameworks to characterize the spreading of social phenomena, such as the diffusion of rumors and fads or the adoption of novelties and technological innovations [START_REF] Daryl | Epidemics and rumours[END_REF][START_REF] Frank | A new product growth for model consumer durables[END_REF][START_REF] Bikhchandani | A theory of fads, fashion, custom, and cultural change as informational cascades[END_REF][START_REF] Everett | Diffusion of Innovations[END_REF]. However, in all these situations the social nature of the contacts that mediate these processes calls for ad-hoc modeling adjustments that are not present in simple disease epidemics models. These approaches, developed under the name of complex contagion, are meant to include additional ingredients, such as mechanisms of social influence and peer pressure, already widely studied within the social sciences [START_REF] Centola | The spread of behavior in an online social network experiment[END_REF][START_REF] Wasserman | Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)[END_REF][START_REF] Centola | Complex contagions and the weakness of long ties[END_REF]. The requirement of these new features, not needed when dealing with the spreading of a pathogen, gave rise to a plethora of models that have been already extensively reviewed in Ref. [START_REF] Guilbeault | Complex contagions: A decade in review[END_REF].

Here, keeping the focus on the dynamics of social contagion, we shift the attention towards the structural aspect of the social contacts on top of which the dynamics evolves. Moving from pairwise to higher-order structures, we investigate the dynamical effects brought by the novel representations. There is a matter of discussion whether social relationships could be better modeled by using simplicial complexes rather than hypergraphs. In the end, depending on the situation, it might be reasonable or not to assume that in a group interaction all the sub-interactions among the group members should be considered as well [START_REF] Kerk F Kee | Social groups, social media, and higher dimensional social structures: A simplicial model of social aggregation for computational communication research[END_REF]. In what follows, we distinguish between the two approaches and discuss recent developments towards the inclusion of HOrSs in the modeling approach. Our limited goal is to introduce some of the recent efforts in this direction without imposing selective constraints on how a "pure" higherorder dynamics should be defined on these new structures. This leads to a mixture of models based on higher-order and not-so-higher-order dynamics on HOrSs. We explicitly distinguish between the HOrSs, starting from spreading processes that take place on simplicial complexes and then moving to hypergraphs.

Spreading on simplicial complexes

In the simplicial contagion model proposed by Iacopini et al. [START_REF] Iacopini | Simplicial models of social contagion[END_REF], a simplicial complex is used to represent the social structure on top of which the contagion dynamics takes place. By definition, all the sub-interactions contained in each group interaction are considered. Therefore, the dynamics of the model specifically relies on the different channels of infections (1-simplex, 2-simplex, etc.) through which, with different transmission rates, a contagion can happen. The SIS-like model of order D is controlled via a set of control parameters β 1 , β 2 , . . . , β D , whose elements represent the probability per unit time for a susceptible node i that participates to a simplex σ of dimension D to get the infection from each one of the infectious sub-faces composing σ (sub-faces in which all nodes but one are infected). At order D = 2, one has β 1 and β 2 = β ∆ corresponding respectively to the probability that a susceptible node i receives the infection from an infected node j through the link (i, j) and to the probability of receiving it from an infectious 2-simplex (i, j, k) incident on i. The recovery dynamics is controlled by the standard recovery probability µ, which, being node-dependent, does not "feel" the higher-order structure (Figs. 29A-G).

Even the inclusion of only the lowest higher-order interactions (2-simplices) dramatically changes the nature of the spreading process, going from a continuous to a discontinuous phase transition in the prevalence as a function of the 1simplex infectivity λ (Fig. 29H). Notice that the nature of the transition depends on the 2-simplex infectivity λ ∆ . This behavior is confirmed by numerical simulations on empirical data obtained from the Sociopatterns collaboration [456] and on synthetic random simplicial complexes (see Sec. IV A 5), where a bi-stable region in which healthy and an endemic states co-exist appears. This is illustrated in Fig. 29I, in which different curves represent different realizations of the model starting from seeds of infectious nodes of different sizes (colors). Further analytical insights on this bistability can be found in Ref. [START_REF] Cisneros-Velarde | Multi-group sis epidemics with simplicial and higher-order interactions[END_REF].

The authors further explained the observed phenomenology through an analytical investigation based on an extension of the standard mean-field (MF) approach for networks, specifically adapted to the case of HOrSs. In this case, the general equation for the evolution of the stationary density of infected ρ(t) reads

d t ρ(t) = -µρ(t) + D d=1 β d ⟨k d ⟩ρ d (t) 1 -ρ(t) (58)
with ⟨k d ⟩ denoting the average generalized degree, i. e., the number of d-dimensional simplices incident on average on each 1-dimensional simplex α: ⟨k d ⟩ = ⟨k d,1 (α)⟩ α (see Sec. III B 1). This approach confirmed the results obtained on synthetic random simplicial complexes, showing that the steady-state dynamics, the position, and the nature of the transition can be predicted analytically on social structures characterized by homogeneous degree distributions. This is shown in Fig. 29H, where the MF curves (red) are compared to the simulated results (points), and in Fig. 29I, where the dashed gray line-corresponding to the unstable solution of the MF approach-correctly detects the two basins of attraction that split the simulated curves.

Further developments of the simplicial contagion model based on probabilistic descriptions showed that more complex analytical formulations, namely the microscopic Markov-chain approach [START_REF] Gómez | Discrete-time Markov chain approach to contact-based disease spreading in complex networks[END_REF] and the link equation [START_REF] Matamalas | Effective approach to epidemic containment using link equations in complex networks[END_REF], can improve the accuracy of predictions [START_REF] Matamalas | Abrupt phase transition of epidemic spreading in simplicial complexes[END_REF]. Differently from the MF, these approaches can indeed be used to analytically describe the contagion dynamics on higher-order heterogeneous structures.

Spreading on hypergraphs

In contrast with simplicial complexes, hypergraphs can be used to describe interactions that only take place in groups, lifting the constraint of having to include all the sub-interactions within the groups themselves. Therefore, hyperedges can efficiently be used to represent clusters or communities, when such sub-interactions are unlikely to be relevant ingredients in the description of social HOrSs [START_REF] Girvan | Community structure in social and biological networks[END_REF][START_REF] Newman | Why social networks are different from other types of networks[END_REF]. Previous results on spreading dynamics on networks have already showed the impact that the presence of clusters, communities and sub-graphs might have on the epidemic threshold and on the final epidemic size [START_REF] Joel | Percolation and epidemics in random clustered networks[END_REF][START_REF] Karrer | Random graphs containing arbitrary distributions of subgraphs[END_REF][START_REF] Hébert-Dufresne | Propagation dynamics on networks featuring complex topologies[END_REF][START_REF] Joel | Spread of infectious disease through clustered populations[END_REF][START_REF] Ritchie | Higher-order structure and epidemic dynamics in clustered networks[END_REF][START_REF] David | Mathematical modeling of complex contagion on clustered networks[END_REF][START_REF] Hébert-Dufresne | Complex dynamics of synergistic coinfections on realistically clustered networks[END_REF][START_REF] St-Onge | Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks[END_REF][START_REF] Hébert-Dufresne | Spread of infectious disease and social awareness as parasitic contagions on clustered networks[END_REF]. Hypergraphs have been also used to model knowledge diffusion in collaboration networks [START_REF] Yang | Knowledge diffusion in the collaboration hypernetwork[END_REF][START_REF] Wang | Improved knowledge diffusion model based on the collaboration hypernetwork[END_REF][START_REF] Peng | A hypernetwork-based approach to collaborative retrieval and reasoning of engineering design knowledge[END_REF].

The idea of modeling communities as hyperedges was first proposed by Bodó et al. [START_REF] Bodó | SIS epidemic propagation on hypergraphs[END_REF], who used the nodes of a hypergraph to represent individuals and hyperedges to represent the different communities a node belongs to, such as a household or a workplace [START_REF] Ghoshal | Sis epidemics with household structure: the self-consistent field method[END_REF][START_REF] House | Deterministic epidemic models with explicit household structure[END_REF][START_REF] Ball | Seven challenges for metapopulation models of epidemics, including households models[END_REF]. The authors studied the behavior of an SIS model on hypergraphs under a continuous time Markov chain formalism in which both infection and recovery are governed by Poisson processes. However, while the recovery is a spontaneous process controlled by a fixed recovery rate γ, the rate of infection r takes into account the higher-order connectivity patterns. In particular, they defined the probability for a susceptible individual to become infected as 1 -exp(-r∆t), with r being r = τ ∑ e f (i e ). The summation runs over all the hyperedges -the communities-containing the susceptible individuals, while f (i e ) denotes a generic function of i e , the number of infected nodes in the hyperedge e. Bodó et al. chose f to be a piece-wise linear function, with the idea of not increasing the infection pressure for a susceptible node when the number of infected neighbors is higher than a given threshold. This is conceptually different from the conventional threshold mechanism-largely exploited by the complex contagion literature-in which thresholds are used in the opposite way, e. g., to set the critical amount of exposures from the peers that an individual needs in order to adopt a new technology [START_REF] Granovetter | Threshold models of collective behavior[END_REF][START_REF] Karsai | Complex contagion process in spreading of online innovation[END_REF]. Simulations on hypergraphs having hyperedges of different sizes showed that heterogeneous structures might significantly fasten the initial phase of the spreading when compared to regular hypergraphs, while leading to slightly smaller values of prevalence in the stationary state.

Later, Suo et al. [START_REF] Suo | Information spreading dynamics in hypernetworks[END_REF] investigated a similar SIS model on hypergraphs particularly designed to study the differences between two different spreading strategies. In the global one, at each time step an infected node i can infect with a probability β all the susceptible neighboring nodes that are connected to i via a hyperedge (global). In the local one, an infected node i randomly chooses e, one of its hyperedges, and then tries to infect with β all the susceptible nodes composing e (local). This is inspired by the different ways in which an individual might decide to share a content on a social media platform, either to all the contacts or exclusively targeting a particular group. Notice that, differently from the higher-order models previously introduced, here the HOrS is used as a structure, but the global contagion dynamics does not specifically "feel" it. Hence, the global spreading strategy would in principle be equivalent to the one defined on the 1-skeleton of the hypergraph, in which each hyperedge is a clique instead.

The two different strategies lead to different long term behaviors, with a vanishing epidemic threshold in the global strategy. Contrarily, the particular positioning of the initial seed of infectious nodes-either on high or low hyperdegree nodes-seems to affect only the early evolution of the process: as expected, choosing nodes with a high hyperdegree as seeders can significantly speed up the contagion in the early times. No differences in the stationary states were found.

The two models just presented made use of the HOrS to define the neighborhood of a node that might be responsible for a contagion event, but no explicit mechanism of peer pressure was included in the modeling framework. Here, we briefly discuss two following works in which, differently from before, the higher-order representation explicitly enters into the contagion dynamics to account for reinforcement effects that might occur at the group level. FIG. 31. SIR model on hypergraphs [START_REF] Ma | Study on information transmission model of enterprise informal organizations based on the hypernetwork[END_REF]. Ignorant (S), spreader (I), and stifler (R) nodes are respectively depicted in blue, red, and green. At each time step a spreader can transmit the information to ignorant nodes within the same hyperedge with a given probability. Figures adapted from Ref. [START_REF] Ma | Study on information transmission model of enterprise informal organizations based on the hypernetwork[END_REF].

hysteresis. Further insights on the conditions for the continuity of the phase transition and the stability of general dynamical process on hypergraphs have been subsequently given in Ref. [START_REF] Ferraz De Arruda | Phase transitions and stability of dynamical processes on hypergraphs[END_REF]. In addition, the authors provide further analytical results on two particular regular hypergraphs, namely a hyperblob (a random regular network with one hyperedge containing all the nodes) and a hyperstar (a star network with one hyperedge containing all the nodes). The critical values analysis is then extended with the introduction of the concept of a "social latent" heat, interpreted as the fraction of individuals to be added or removed to move the dynamics from one solution to the other.

These findings provide a possible phenomenological explanation for some apparently contradictory results previously obtained. In fact, experimental work has shown different values of critical mass levels needed to initiate a social change, i.e., to revert an existing equilibrium to a new one by mean of a committed minority [START_REF] Dahlerup | From a small to a large minority: Women in Scandinavian politics[END_REF][START_REF] Grey | Numbers and beyond: The relevance of critical mass in gender research[END_REF][START_REF] Centola | Experimental evidence for tipping points in social convention[END_REF]. These threshold values, spanning from 10% to 40%, could be consistently seen as the effect of the interplay between a global critical mass and the local thresholds as given by the Θ α , which also depend on the size of the interacting group.

Finally, Ma and Guo [START_REF] Ma | Study on information transmission model of enterprise informal organizations based on the hypernetwork[END_REF] introduced different extensions of the SIR model to hypergraphs. In their model, placed within the framework of rumor spreading [START_REF] Dietz | Epidemics and rumours: A survey[END_REF][START_REF] Moreno | Dynamics of rumor spreading in complex networks[END_REF], individuals are divided into the three standard classes corresponding to ignorant (S), spreader (I), and stifler nodes (R). In this particular context, the spreading process wants to model the transmission of information between different members of an enterprise, whose internal structure is characterized by informal organizations (spontaneous groups). In particular, Ma and Guo consider different variations of the mechanism of information transmission. Figure 31 reports an illustrative example of the probabilistic transmission, as defined by the authors. At t = 0 (Fig. 31A), all the nodes are ignorant (blue). At t = 1 (Fig. 31B), the information starts to spread, with a given probability, from a randomly selected spreader node (red) to the other nodes within the same hyperedge. Subsequently, the rumor reaches more and more nodes while some nodes become stifler (green) and can no longer spread the information. Other variations where the information passes to the entire hyperedge at once or to a constant number nodes within the same hyperedge are also considered.

B. Opinion and cultural dynamics beyond pairwise interactions

In this subsection, we will review some of the best known models of opinion and cultural dynamics. At the core of these agent-based models, often referred to as spin models in the physics literature or as interacting particle systems in the mathematics literature, there is the idea of describing a social dynamics by relying on simple-yet sufficientrules. Many different variations and extensions have been proposed and extensively studied, therefore we will limit our focus to those for which, in the spirit of this review, an higher-order extension exists.

Voter model

With its origins deeply rooted in the statistical physics literature, the voter model is one of the simplest models of opinion dynamics [START_REF] Milton | Interacting Particle Systems[END_REF]. In the most basic version, it consists in a population of N interacting individuals located on the sites of a lattice, each endowed with a binary variable (spin) σ i = {-1, 1}, i = 1, . . . N , representing an opinion, or a vote. The fundamental mechanism of the model relies in the node-update rule, according to which, at each time step, a randomly selected node copies the opinion of a randomly selected neighbor (Fig. 32A). This dynamics is iterated until one of the absorbing states of full consensus is reached. Despite its simplicity, this model presents a nonequilibrium dynamics leading to non-trivial behaviors [START_REF] Shao | Dynamic opinion model and invasion percolation[END_REF]. Extending the voter dynamics from a lattice to a network requires a change of perspective. Indeed, in order to maintain the average magnetization of the system, one has to move from the aforementioned node-update rule to a link-update rule [START_REF] Suchecki | Conservation laws for the voter model in complex networks[END_REF] (Figs. 32B,C). This is because the degree heterogeneity potentially present in a network biases the random selection of the neighboring nodes in favor of the most connected ones, ultimately making the "order of play" matter. As for many other dynamical processes on structured populations, the interplay between structure and dynamics has been the focus of many studies [START_REF] Suchecki | Voter model dynamics in complex networks: Role of dimensionality, disorder, and degree distribution[END_REF]. Introducing the many different-and sometimes multi-layered [START_REF] Diakonova | Irreducibility of multilayer network dynamics: The case of the voter model[END_REF]-variations of the voter model and their applications [START_REF] Fernández-Gracia | Is the voter model a model for voters?[END_REF] goes beyond the scope of this review, therefore we now focus on the particular version that has been generalized in order to account for higher-order interactions.

If we let the node variables take more than two values-going beyond binary opinions-we can call colors these different opinions, and as a consequence the voter dynamics becomes a coloring coordination game (see Sec. VIII). Motivated by coloring game experiments [START_REF] Kearns | An experimental study of the coloring problem on human subject networks[END_REF][START_REF] Judd | Behavioral dynamics and influence in networked coloring and consensus[END_REF] in which agents make informed decisions based on some local information available, i.e., a subset of nodes, Chung and Tsiatas used hyperedges as a natural way to encode these group interactions [START_REF] Chung | Hypergraph coloring games and voter models[END_REF]. In their model, voters have non-pairwise relationships which are represented as hyperedges of a hypergraph, and the dynamics obeys to the following hyperedge-update rule (Fig. 32D). At each time step a hyperedge is selected, and the nodes composing it simultaneously change their vote according to a given probability. In the simplest case this probability does not depend on the status of the voters at the time of the interactions. Further insight on the process can be gained by using the duality of the process with a random walk on an associated weighted graph whose weights encode the transition probabilities among different voting configurations. By performing this mapping, Chung and Tsiatas were able to study the dynamics of the memoryless game in terms of the spectral properties of the random walk.

Another prominent research topic in network science deals with the investigation of dynamical processes that directly affects the structure of the network. This co-evolution of network structure with the dynamics that takes place on it is particularly relevant when it comes to modeling social systems, in which the states of the nodes or a behavioral change might force the network to react by changing its connectivity patterns. Voter models with binary opinions have been widely extended in this direction, and many versions of adaptive voter models have been proposed [START_REF] Redner | Reality-inspired voter models: A mini-review[END_REF]. The minimal adaptive voter model on networks works as follows [START_REF] Vazquez | Generic absorbing transition in coevolution dynamics[END_REF]. At each time step an edge e is randomly selected. If e is inactive, i.e., it connects nodes with the same opinions, nothing happens. Contrarily, if e is active, there are two possible mechanisms, both leading to the death of this active link in favor of a inactive one. More precisely, with probability p ∈ [0, 1] a rewiring happens. In this case a randomly selected node between the two composing e rewires to a random node in the network that shares its own opinion. Otherwise, with probability 1 -p one of the two nodes of e, selected at random, adapts its opinion to the one of the other, ultimately making e inactive. Recently, Horstmeyer and Kuehn have extended this model in order to account for higher-order structures, such as simplicial complexes [START_REF] Horstmeyer | Adaptive voter model on simplicial complexes[END_REF]. In their model, studied for simplicity up to the level of the 2-simplices, an edge e (1-simplex) is randomly selected. If e is not part of a 2-simplex the standard rules just defined on networks apply. Alternatively, if e is active and part of at least one 2-simplex then a new mechanism of peer pressure might appear. This is controlled via a second parameter q ∈ [0, 1] representing the probability of the higher-order structure affecting the dynamics through a majority rule. When this happens, with probability q, one of the 2-simplices containing e is selected at random, and all its nodes adopt the opinion of the majority with probability p. Similarly to the standard case, with probability 1 -p a rewiring happens, but this time on the 2-simplices. In particular, all the 2-simplices containing e are "downgraded" to three standard 1-simplices and an equal number of new 2-simplices is created by randomly "promoting" triangles of the network formed solely by 1-simplices. However, this mechanism combined with the rewiring leads to a natural depletion of 2-simplices that determines the stopping criterion for the simulations (when there are no triangles left to "promote"). This models reduces to the standard one when q = 0, while for q > 0 the simplicial structure plays a relevant role on the dynamics. In this last regime, the characteristic behavior of the adaptive voter model does not change and one can still observe a transition at a critical value p c between an active phase with a nonzero stationary density of active links and a frozen phase in which the system breaks up into two disconnected components having opposite opinions. However, the higher-order structure has several effects on the model dynamics. When q > 0 the speed at which the dynamics reaches the two phases is increased, the critical p c separating the phases is shifted towards lower values of rewiring, and the stationary density of active edges in the first phase is lowered due to the peer pressure mechanism introduced.

Majority models

A similar class of models is the one of the majority vote models, originally proposed by Galam [START_REF] Galam | Minority opinion spreading in random geometry[END_REF]. In the most basic formulation, individuals are endowed with binary state variables denoting opinions, and interact without specific topological constraints. These models behave similarly to the voter-like models discussed above, but with one fundamental difference in the updating rule. In fact, as the name suggests, here the copying mechanism is replaced by a deterministic majority rule according to which, at each time step, a subset of n individuals is chosen and their opinion is set to the one of the majority within the subset. An additional bias-justified as social inertia-that favors a particular opinion is usually introduced to resolve ties when n is even. Typical quantities of interests are the probability of reaching a particular type of consensus as a function of the initial configuration and the time required to reach it. Many studies have been conducted in this regard by using models on lattices and graphs, highlighting the key role played by the dimensionality of the system, together with changes in the dynamics when finite or infinite systems are considered. In all these cases, i.e., when a structured population is used, the node-update consists in adopting the opinion of the majority of the neighboring nodes. In this sense, the majority rule model can be seen as a special case of a threshold model in which the threshold parameter of each node is set to half of the number of neighbors [START_REF] Duncan | A simple model of global cascades on random networks[END_REF].

The spatial version of the majority rule model proposed by Lanchier and Neufer [START_REF] Lanchier | Stochastic dynamics on hypergraphs and the spatial majority rule model[END_REF] is based on the idea that social groups are better defined in terms of hyperedges rather than dyadic interactions. Thus, they extended the majority rule model on HOrSs defined as hypergraphs, so that nodes within each hyperedge simultaneously change their opinion to the majority opinion of the hyperedge they are part of. By focusing on a particular regular social structure, in which a hyperedge consists of a n × ⋅ ⋅ ⋅ × n block on a lattice, they were able to show through analytical results and simulations that, for each dimension, the model dynamics behaves similarly to the voter model when a fixed odd number n of interacting nodes is selected. This means that for hyperedges of even size n the system always reaches a consensus where all the nodes have the opinion favored by the bias, while if n is odd, the system presents growing clusters that eventually reach consensus. This is radically different from the voter model in high dimensions (d ≥ 3), in which the system reaches a stationary state in which the two opinions co-exists (see Sec. IX C).

A popular variation of the majority rule is the majority vote model [START_REF] Milton | Interacting Particle Systems[END_REF], in which a parameter q ∈ [0, 1] is introduced so that a node changes its state to the one of the majority of its interacting nodes with probability (1 -q). Since q controls the randomness, sometimes the model goes under the name of majority-vote model with noise, and it obeys the following update-rule. At each time step, an individual i is selected, and its opinion σ i is flipped with probability

w(σ i ) = 1 2 ⎛ ⎝ 1 -(1 -2q)σ i sgn j σ j ⎞ ⎠ (60)
where the sum ∑ j σ j runs over all the nodes j that are interacting with i so that sgn(⋅) takes either the sign of the argument or is equal to 0 in case of a lack of majority (zero sum).

Results on regular lattices show that the model undergoes an order-disorder phase transition at a critical value q c [504], with critical exponents falling within the universality class of the corresponding equilibrium Ising model, with q acting as a temperature. A similar behavior was found on Erdős-Rényi random graphs [START_REF] Luiz | Majority-vote model on random graphs[END_REF]. Contrarily, in small world networks the position of the transition point was found to be a function of the rewiring probability [START_REF] Paulo Ra Campos | Small-world effects in the majority-vote model[END_REF][START_REF] Edina | Majority-vote on directed small-world networks[END_REF], with critical exponents not belonging to the same universality class of the corresponding Ising model. The same holds for directed and undirected networks with heterogeneous degree distributions P (k) ∝ k -α [START_REF] Lima | Majority-vote on directed Barabasi-Albert networks[END_REF][START_REF] Lima | Majority-vote on undirected Barabási-Albert networks[END_REF].

Gradowski and Krawiecki extended the majority vote model to the case of hypergraphs [START_REF] Gradowski | Majority-vote model on scale-free hypergraphs[END_REF]. They introduced two different higher-order versions, a first one based on a node-update rule and a second one based on a hyperedge-update rule. According to the hyperedge-update dynamics, a hyperedge, representing a group, is randomly selected. The majority is then checked within the group. With the node-update dynamics, a random node is selected at random and then the majority rule acts on one of its hyperedges, selected at random as well. In both cases, when a hyperedge α is selected the opinions of all the nodes in α are updated according to the standard rule, as in Eq. ( 60), but with the sum ∑ j σ j running over all the nodes j ∈ α instead (including the node of the node-update rule). The main difference between the two rules is in the interaction dynamics. While in the first case each node at each time step interacts with all the other nodes in a shared group, in the second case just the nodes of a single group are considered. Obviously, this difference becomes significant when heterogeneous structures are considered. Thus, Gradowski and Krawiecki studied the model on SF hypergraphs having a hyperdegree distribution that follows a power law P (k) ∝ k -γ with γ = 1+ N N -m , constructed by using a growth model with preferential attachment [START_REF] Wang | Evolving hypernetwork model[END_REF] (see Sec. IV B 3). Both dynamics present a similar behavior, with a second-order phase transition appearing at a finite critical value q c . Notice that here the transition appears even for a SF exponent 2 < γ < 3, while the Ising model on SF networks presents a phase transition at finite temperature only for γ > 3 [START_REF] Hong | Finite-size scaling in complex networks[END_REF]. As expected, the heterogeneous structure affects the two dynamics in different ways. In the case of the hyperedge-update, the topology does not have a strong influence on the critical exponents, and the hyperedge dynamics locally behaves as a mean-field for the Ising model. In contrast, when the node-update rule is considered the hypergraph topology matters, and the values of the critical exponents strongly differ from the corresponding equilibrium Ising model on SF networks having the same γ.

Continuous models of opinion dynamics

The different models discussed so far describe the dynamics of interacting agents having discrete opinions. This approaches are suitable in those cases in which an individual can only have a clear and well-defined opinion on a subject, such as in politics, where one could be for or against the introduction of a given policy or the adoption of a given strategy. However, to model the more general dynamics of political orientation, discrete opinion variables might be too restrictive, leaving only "black or white" polarized options. In these cases, the opinion of an individual might be better represented by a continuous variable x i ∈ [0, 1] spanning between two extremes [START_REF] Deffuant | Mixing beliefs among interacting agents[END_REF][START_REF] Lorenz | Continuous opinion dynamics under bounded confidence: A survey[END_REF]. Neuhäuser et al. [START_REF] Neuhäuser | Multibody interactions and nonlinear consensus dynamics on networked systems[END_REF] have investigated the effects of non-linear interactions in a model of continuous opinions dynamics on HOrSs. Starting from the formalism of dynamical systems on networks (see Sec. V), they have proposed a generalization with (3-body) higher-order interactions that captures the two important social mechanisms of peer pressure and homophily [START_REF] Miller Mcpherson | Birds of a feather: Homophily in social networks[END_REF][START_REF] Solomon | Effects of group pressure upon the modification and distortion of judgments[END_REF]. In their model, nodes interacts through the hyperedges of size 3 of a hypergraph. The evolution of the N dynamical variables x i is given by: ẋi = N j,k=1

A ijk s( x j -x k ) Influence function [(x j -x i ) + (x k -x i )]
Linear term [START_REF] Mahadevan | Systematic topology analysis and generation using degree correlations[END_REF] where the adjacency tensor A ijk restricts the interactions between nodes that share a hyperedge (see Sec. III A 2). Notice that the standard linear term, denoting the influence of the two nodes j and k on i, is modulated by an additional influence function s(x) which depends on the difference between the states of the other nodes composing the hyperedge. According to the choice of s(x), this model can reproduce the reinforcing or inhibitory effects that two nodes of a 2-simplex can have on the third one. For example, with a form s( x j -x k ) = exp(λ x j -x k ) and λ < 0, similar states of j and k can accelerate the dynamics of i (or decelerate if λ > 0). As expected, if the influence function is constant, i. e. λ = 0, the standard linear case is recovered and the dynamics conserves the average state at time t, typically defined as x = 1 N ∑ i x i (t). Interestingly, this is not true when non-linear interactions are considered. Neuhäuser et al. have showed that in the mean-field approach the higher-order interactions may produce a shift on the average state of the system depending on the initial state of the nodes. In particular, for an unbalanced binary initialization (x(0) ≠ 0.5) the asymptotic average state is shifted towards the majority if λ < 0 (Fig. 33A) or towards balance if λ > 0 (Fig. 33C). These results are confirmed by numerical simulations on fully connected hypergraphs. Further analyses on modular hypergraphs have highlighted the additional role played but local sub-graphs in driving the system towards an asymmetric dynamics when non-trivial topologies are considered.

Cultural dynamics

In the previous Section, we reviewed models that made use of scalar variables to represent evolving opinions. There is a general agreement in calling models with such characteristics opinion models. A separate class of cultural models, originally proposed by Robert Axelrod [START_REF] Axelrod | The dissemination of culture: A model with local convergence and global polarization[END_REF], define the cultural profile of an individual as a vector rather than a scalar. This approach, useful to model the emergence of multi-culturality, incorporates two basic mechanisms of homophily and social influence into what is called now, unsurprisingly, the Axelrod model. In this model, individuals interact through the links of a social network by imitating each other, that is by copying an element of the feature vector of a neighbor. The imitation probability is proportional to the so-called cultural overlap among the two nodes, which in the original model corresponds to the fraction of common cultural features. The model has been extended to multi-layer networks, where interactions among individuals on different topics, such as religion, sport or politics, happen on different layers [START_REF] Battiston | Layered social influence promotes multiculturality in the Axelrod model[END_REF]. This approach allows for interaction patterns that are topic specific, therefore limiting the social influence among two individuals to the subset of features on which there is an actual social interaction (a link in the topic layer).

Even if a "proper" extension of these model to HOrSs is still missing, HOrSs have still found their way into these modeling approaches. For example, Maletić and Rajković [START_REF] Maletić | Consensus formation on a simplicial complex of opinions[END_REF] proposed to move away from the vectorial representation of cultural features and adopt a higher-order representation instead. In this case, an opinion can be represented as a set of interconnected judgments, so that different judgments forming an opinion represent the vertices of a simplex. In this formulation, overlapping opinions sharing arguments or judgments correspond to simplices sharing faces and ultimately forming a simpicial complex of opinions. This framework opens up new research directions in which overlapping opinions can then be used to shape social interactions [START_REF] Maletić | Hidden multidimensional social structure modeling applied to biased social perception[END_REF].

VIII. EVOLUTIONARY GAMES

Imitation is an important mechanism to model social dynamics, at the heart of many processes described in Section VII. Yet, in several cases individuals do not make decisions simply based on peer pressure and social influence [START_REF] Carlos P Roca | Evolutionary game theory: Temporal and spatial effects beyond replicator dynamics[END_REF]. In many contexts, they can set and update their behavior based on strategic choices. In biology, for instance, the selection of a specific physical trait among the many alternatives typically occurs because of the beneficial effects which it brings to the survival of the species. Similarly, human decisions, or dilemmas, are frequently based on computing and evaluating a trade-off between the positive and negative consequences of different scenarios.

Games are often studied in a simple dyadic setting, where pairs of individuals are given the chance to pursue either a selfish strategy and defect (D), or a cooperative choice (C), with the selfish strategy being the more rewarding unless both of them undertake it. In the most general set-up, pairwise games can be defined according to a payoff matrix:

C D C R S D T P ( 62
)
where R is the reward obtained by a cooperator playing against another cooperator, S is the sucker payoff received by a cooperator when its opponent is a defector, T is the temptation a defector has to resist when it plays against a cooperator, and P is the punishment that a defector receives when it plays against another defector. Games where more than two strategies are possible, such as the rock-paper-scissors [START_REF] Szabó | Rock-scissors-paper game on regular small-world networks[END_REF][START_REF] Szolnoki | Cyclic dominance in evolutionary games: a review[END_REF], are not discussed in this section.

Games can be categorized into different classes, based on the relative order of the four payoffs previously introduced. The most famous game is the prisoner's dilemma [START_REF] Axelrod | The Evolution of Cooperation[END_REF][START_REF] Rapoport | A Taxonomy of 2 x 2 Games[END_REF], where two members of a criminal gang are arrested and isolated from each other. As each prisoner could be convicted of a small charge, but there are no sufficient evidence to convict them for the main greater charge, both prisoners are given the opportunity to bargain, i.e. defecting by stating that the other committed the crime, and being in exchange set free. Cooperation is harmed by a high temptation T , as in this setting the payoff associated to defect against a cooperator yields a higher payoff than the reward R associated to both players cooperating and staying silent. Besides, cooperating against a defector gives the lowest earning, typically known as sucker S payoff, and the payoff ordering of the game is T > R > P > S. As no defecting player can benefit by changing strategy if the others keep theirs unchanged, this makes the decision of both players to defect, i.e. punishment P , the Nash equilibrium of the system, despite being a less rewarding situation than full cooperation.

Many alternative real-life situation have been described as social dilemmas. The Stag-Hunt game describes the dilemma of two hunters, which must cooperate to kill a stag and avoid going hungry [START_REF] Rousseau | The discourses and other political writings[END_REF][START_REF] Luce | Games and decisions: Introduction and critical survey[END_REF]. It is described by the ordering R > T > P > S, and suitable to formalize conflicts between cooperation and safety. Differently from the prisoner's dilemma, this game has two distinct pure Nash equilibria, full cooperation, leading to the highest payoff, and full defection, which is risk dominant as it prevents from the risk to be the only hunter involved in the attempt to kill the animal. The Stug-Hunt is a coordination game, as it requires the two individuals to coordinate in order to converge towards the payoff dominant equilibrium.

Other games are described by the payoff ordering T > R > S > P . This ordering is associated to the chicken game, where two individuals drive towards each other looking for a free way at the risk that both may die in the crash, but hoping that the other swerves away (acting cowardly like a poultry). Outside the political sciences, the same ordering of payoff is typically referred to as the snowdrift game. In this game, a snowdrift is blocking the way, and at least one of two individuals has to shovel away snow to free the road. This setting describes well situations where defectors benefit from cooperators without paying a cost for accomplishing a given task, but at least a cooperator is needed for the task to be performed. Here the player's optimal choice depends on what their opponent is doing, as one should yield only if the opponent fails to. For this reason, the chicken game is an anti-coordination game [START_REF] Gui | Economics and Social Interaction: Accounting for Interpersonal Relations[END_REF]. It is worth to notice that the same ordering is also associated to the hawk-dove game, where two players compete for a resource to be shared, an outcome which is possible without damage only when two doves meet [START_REF] Maynard | Evolution and the Theory of Games[END_REF][START_REF] Maynard | The logic of asymmetric contests[END_REF][START_REF] Cressman | Evolutionary stability for two-stage hawk-dove games[END_REF]. All these games have two pure Nash equilibria, in which each player plays one of the pair of strategies, and the other player chooses the opposite one.

These dilemmas were introduced as static games. Almost fifty years ago the pioneering work of John Maynard Smith [START_REF] Maynard | Game theory and the evolution of fighting[END_REF] first considered the dynamics of a population with repeated strategic interactions, a discipline now known as evolutionary game theory. In the well-mixed scenario, where all agents have equal probability to interact with each other, the evolution of the fraction of cooperators x c can be tracked by the set of differential equations describing the so-called replicator dynamics [START_REF] Diederich | Replicators with random interactions: A solvable model[END_REF][START_REF] Hofbauer | Evolutionary Games and Population Dynamics[END_REF][START_REF] Opper | Replicator dynamics[END_REF][START_REF] Chawanya | Large-dimensional replicator equations with antisymmetric random interactions[END_REF]

ẋc = x c (1 -x c )[π C -πD ] ( 63
)
where πC is the average pay-off of a cooperator, and πD the average pay-off of a defector. The replicator equations are also widely used to model species interactions, as we will discuss in Section IX C. Numerically, the dynamics of games are often studied as agent-based models [START_REF] Perc | Coevolutionary gamesa mini review[END_REF]. The importance of numerical simulations, in particular in the case of agents placed on a network, is also linked to the limitations achieved by analytical methods. A first approach is the so-called best response, where individuals choose the strategy which produces the best outcome for them taking the strategies of the other players as given. However, more complex update processes are often considered, where players can update their strategy by imitating the behavior of the most successful individuals, where the higher copying probability the larger the difference in earnings. This allows to consider more realistic scenarios, where agents can also make mistakes.

For the prisoner's dilemma, in well-mixed population (where at each round individuals have the same probability to play with any other agent in the population) the evolutionary dynamics brings the system into a state of full defection [START_REF] Hofbauer | Evolutionary Games and Population Dynamics[END_REF]. This is in spite of the low payoff associated to the outcome, a situation sometimes referred to as the tragedy of the commons [START_REF] Hardin | The tragedy of the commons[END_REF]. However, when populations are structured, meaning that interactions between agents-often limited by spatial constrains-can be described by a network of relationships, cooperators are able to emerge even in adverse settings. First discovered by Nowak and May by placing agents at the nodes of a simple square lattice, repeated games between the same pairs of individuals allow for network reciprocity, i.e. the creation of robust mutual interactions based on trust, even if the temptation to defect would prove to be more rewarding in a single individual round [START_REF] Martin | Evolutionary games and spatial chaos[END_REF]. Graphs which are heavy-tailed [START_REF] Francisco | Scale-free networks provide a unifying framework for the emergence of cooperation[END_REF][START_REF] Gómez-Gardenes | Dynamical organization of cooperation in complex topologies[END_REF] or clustered [START_REF] Assenza | Enhancement of cooperation in highly clustered scale-free networks[END_REF] provide the best conditions for At each elementary step a player i and one of its neighbors j are chosen at random. Each individual accumulates earnings by playing all games in which it is involved, namely the game in which it is the focal individual of the group, and the k games where it participates in a group centered on one of its neighbors. All groups in which i and j participate are listed in panels (A) and (C), for a simple two-dimensional lattice (B). Finally, i compares its payoff to that of j, updating its strategy by imitating the strategy of the neighbor with a probability which depends on the relative difference of the payoff. The presence of links among neighbors of i and j (clustering) does not affect the definition of the groups.

the emergence of cooperation, exploiting the beneficial effect of prosocial hubs and the presence of tightly connected communities to sustain the formation of trust among players.

In the snowdrift game the relative values of the sucker payoff and punishment are inverted, as a lone cooperative shoveler still has a better cost benefit ratio than an individual in a pair where both agents defect. This appearently small difference generates the emergence of a stable state with coexisting cooperators and defectors in structuredless population, differently from the prisoner's dilemma [START_REF] Hofbauer | Evolutionary Games and Population Dynamics[END_REF]. Surprisingly, spatial structures were shown to be detrimental for cooperation in the snowdrift game [START_REF] Hauert | Spatial structure often inhibits the evolution of cooperation in the snowdrift game[END_REF].

In the last 15 years the fields of evolutionary game theory and network science have become significantly closer, and we are now witnessing an explosion of contributions at the boundary of these topics [START_REF] Nowak | Five rules for the evolution of cooperation[END_REF][START_REF] Szabó | Evolutionary games on graphs[END_REF][START_REF] Wang | Evolutionary games on multilayer networks: a colloquium[END_REF]. In the following of this Section, going beyond the traditional pairwise scheme, we provide an overview of the main results on evolutionary games in networks with group and higher-order interactions.

A. Multiplayer games on networks

Public goods game

Many dilemmas do not involve pairs of individuals, but occur at the level of groups. This is the case of taxes for welfare state, which are beneficial from an individual perspective only if most individuals are willing to contribute. The public goods game is the paradigmatic game to describe social dilemmas in the case of group interactions [START_REF] Sigmund | The Calculus of Selfishness[END_REF][START_REF] Archetti | Review: Evolution of cooperation in one-shot social dilemmas without assortment[END_REF][START_REF] Perc | Evolutionary dynamics of group interactions on structured populations: A review[END_REF][START_REF] Perc | Statistical physics of human cooperation[END_REF], and it is considered the generalization of the prisoner's dilemma to N > 2 players. In the most simple implementation, players, belonging to a group of size G, are asked to contribute to a common pool. Cooperators contribute with a token t whereas defectors do not contribute at all. The tokens are then multiplied by a synergy factors R, with R < G, and shared evenly across the population no matter the strategy of the agents. For this reason, if we indicate with N c the number of cooperators in the group, cooperators earn a payoff π c = t(N c R G -1), whereas defectors obtain π d = t(N c R G). To simplify the payoffs and without loss of generality, t can be set equal to 1. The game is fully controlled by the effective parameter r = R G, which is known as the reduced synergy factor. The traditional implementation of a multiplayer game on a graph is illustrated in Fig. 34. As explained later on, different implementations are necessary if one wants to explicitly take into account the real pattern of higher-order interactions among individuals.

Similarly to the prisoner's dilemma, the network structure affects the emergence of cooperation also in the public goods game [START_REF] Francisco | Scale-free networks provide a unifying framework for the emergence of cooperation[END_REF][START_REF] Peña | Evolutionary games of multiplayer cooperation on graphs[END_REF]. Simulations on lattices first showed that structured interactions sustain cooperation for values of the synergy factor well below the critical condition R = G [START_REF] Szabó | Phase transitions and volunteering in spatial public goods games[END_REF][START_REF] Brandt | Punishment and reputation in spatial public goods games[END_REF]. Yet, interest in the public goods game sparked when more realistic network structures with heterogeneous degree distributions were considered [START_REF] Francisco C Santos | Social diversity promotes the emergence of cooperation in public goods games[END_REF]. In heterogeneous networks, at every round each agent is involved in k + 1 games (where k is the degree of each node), meaning that hubs play significantly more games than agents placed on poorly connected vertices. In the implementation known as fixed cost per game, in particular, (k + 1) is also the total contribution of each agent after a full round. Because of this inequality, another set-up has also been widely investigated, where each agent has a fixed cost per individual t, and hence each game contributes to its total payoff as 1 (k + 1). Fixed costs per individual are considered a suitable setting to model cumulative costs, such as in the case of taxes, while fixed costs per individual are best suited to model a scenario in which the resource associated to the cost is finite, and it is equally distributed among players. In scale-free networks cooperation was found to be significantly enhanced through network reciprocity if cooperators pay a fixed cost per individual, whereas the same effect is reduced when prosocial individuals pay a fixed cost per game [START_REF] Francisco | Scale-free networks provide a unifying framework for the emergence of cooperation[END_REF]. The enhanced cooperation of the first scenario is due to the disproportionately higher payoff obtained by those agents participating in a very large amount of groups.

The beneficial effect from interacting according to a scale-free networks can be lost if the underlying structure is characterized by positive degree-degree correlation, reducing the evolutionary advantages of individuals with highdegree who decide to cooperate [START_REF] Rong | Effect of the degree correlation in public goods game on scale-free networks[END_REF]. Similarly to pairwise games, tight community structure and clustering can sustain positive feedback and the survival of cooperators for low values of the synergy factor also in the public goods game [START_REF] Rong | Feedback reciprocity mechanism promotes the cooperation of highly clustered scale-free networks[END_REF]. Prosocial behavior may be further promoted by allowing heterogeneous contributions, for instance by making them proportional to the cooperation of each group [START_REF] Gao | Diversity of contribution promotes cooperation in public goods games[END_REF][START_REF] Vukov | Escaping the tragedy of the commons via directed investments[END_REF]. However, interestingly, increasing group size does not always lead to the dynamics of well-mixed populations in such a multiplayer game [START_REF] Szolnoki | Group-size effects on the evolution of cooperation in the spatial public goods game[END_REF].

Multiplayer games are considered to be inherently different from the corresponding pairwise games, as the emergent collective behavior in the case of group interactions might be different [START_REF] Perc | Collective behavior and evolutionary games an introduction[END_REF]. This is rooted in the formation of indirect links between players who belong to the same group but are actually disconnected. As an important consequence of this, the details of the local topology of the network of interactions for multiplayer games are often irrelevant for the final outcome, as discussed in Ref. [START_REF] Szolnoki | Topology-independent impact of noise on cooperation in spatial public goods games[END_REF]. Besides, multiplayer games also show qualitatively different evolutionary dynamics, giving rise to new forms of self-criticality which have not been observed in pairwise games [START_REF] Szolnoki | Correlation of positive and negative reciprocity fails to confer an evolutionary advantage: Phase transitions to elementary strategies[END_REF]. Among those, we report the emergence of new temporal and spatial patterns of dominance, such as the so-called indirect territorial competition, first reported in a modified public goods game in Ref. [START_REF] Helbing | Evolutionary establishment of moral and double moral standards through spatial interactions[END_REF].

More recently, the role of multiplexity has also been taken into account. In this setting, different layers are associated to different games (different values of the synergy factor) and individuals may have different neighbors depending on the layer. While not making possible direct strategy exchanges between the networks, interconnectedness can affect the utility function of players, who do not have access to the earnings of their neighbors on each of the layers but only to a (possibly non-linear) combination of them [START_REF] Wang | Evolution of public cooperation on interdependent networks: The impact of biased utility functions[END_REF]. Interestingly, this simple payoff coupling was shown to further enhance cooperation in the whole system, through a mechanism dubbed interdependent network reciprocity [START_REF] Wang | Interdependent network reciprocity in evolutionary games[END_REF]. Despite the presence of the same synergy factors at different layers, the system naturally self-organizes into a configuration where one layer is more cooperative than the others through spontaneous symmetry breaking [START_REF] Wang | Interdependent network reciprocity in evolutionary games[END_REF]. However, interdependent network reciprocity is not a universal properties of all interconnected systems, but strongly depends on the structure of the layers. In particular, interdependent network reciprocity is proportional to the fraction of edges shared by the different layers (i.e. edge overlap [START_REF] Battiston | Structural measures for multiplex networks[END_REF]), and the beneficial effects of multiplexity completely disappear when the overlap between the network structures goes to zero, no matter the number of layers [START_REF] Battiston | Determinants of public cooperation in multiplex networks[END_REF]. In this detrimental configuration, cooperators can appear in the system only if the synergy factors of all layers are at least as high as the critical conditions associated to each network in isolation [START_REF] Battiston | Determinants of public cooperation in multiplex networks[END_REF]. Further coverage on the effects of multiplexity and network interdependence on evolutionary games is provided in Ref. [START_REF] Wang | Evolutionary games on multilayer networks: a colloquium[END_REF].

Much attention has also been devoted to the case of coevolutionary games, where the structure of the networks of social interactions may change over time as a result of the outcome of the strategic interactions among players [START_REF] Perc | Coevolutionary gamesa mini review[END_REF]. When individuals can alter the connections in their social network in response to unsatisfactory interactions, coevolution between cooperation and spatial organization in the public goods game naturally leads to increased social cohesion [START_REF] Carlos | Emergence of social cohesion in a model society of greedy, mobile individuals[END_REF] and prosocial behavior [START_REF] Pichler | Public goods games on adaptive coevolutionary networks[END_REF]. A different setting is considered in Ref. [START_REF] Ren | Coevolution of public goods game and networks based on survival of the fittest[END_REF], where a survival cost parameter is introduced, and agents with low payoff are replaced in the games by new random players. With this mechanism, cooperation emerges if the synergy factor is higher than the average degree, and the population self-organizes into a scale-free network of interactions, naturally more beneficial to sustain prosocial behavior. Finally, coevolutionary rules have been implemented in the case of interdependent network of players, leading to complex social structures where strong inter-layer links were promoted around agents performing the best [START_REF] Shen | Coevolutionary resolution of the public goods dilemma in interdependent structured populations[END_REF].

As most of these results rely on numerical simulations, it is important to highlight the importance of proper simulations practices. An important contribution to the topic is found in Ref. [START_REF] Perc | Stability of subsystem solutions in agent-based models[END_REF], which investigates the stability of observations from agent-based model simulations going beyond traditional finite-size scaling, or on the role of noise [START_REF] Alberto | The role of noise in the spatial public goods game[END_REF]. In particular, only a complete stability analysis of all subsystems solutions (solutions that are formed by a subset of all possible individual strategies) can be explicitly linked to the existence of a phase transition in the thermodynamic limit in multiplayer games where competing strategies are more than two. For a complete review on the public goods game on networks, we refer the interested reader to the work by Perc et al. "Evolutionary dynamics of group interactions on structured populations: A review" [START_REF] Perc | Evolutionary dynamics of group interactions on structured populations: A review[END_REF].

Other multiplayer games

The public goods game is not the only multiplayer game whose evolutionary dynamics has been studied on graphs. An interesting alternative is the generalized multiplayer snowdrift game, where individuals receive a benefit b if the task is performed by one or more agents belonging to their same group, no matter their strategy [START_REF] Zheng | Cooperative behavior in a model of evolutionary snowdrift games with N-person interactions[END_REF]. In this game cooperators share the workload and have a payoff π c = bc N c , while defectors have a payoff π d = b as long as there is at least a cooperator in the group, otherwise π d = 0. In well-mixed populations cooperation decreases with high cost-to-benefit ratio, as well as a function of the number of agents in a group [START_REF] Zheng | Cooperative behavior in a model of evolutionary snowdrift games with N-person interactions[END_REF]. When network structures are considered, the introduction of an underlying homogeneous graph steadily promotes prosocial behaviors, similarly to the corresponding game played on well-mixed populations. By contrast, heterogeneous networks typically generate multiple new internal equilibria [START_REF] Marta D Santos | Dynamics of N-person snowdrift games in structured populations[END_REF]. The introduction in the game of dynamical grouping, where agents are placed in groups of different sizes at different times, and players of different strategies are dynamically mixed was found to greatly enhance prosocial behavior [START_REF] Hwan | Effect of high-pressure oxygen annealing on negative bias illumination stress-induced instability of InGaZnO thin film transistors[END_REF]. A common modification of the traditional multiplayer snowdrift games links the benefit of accomplishing a task to the existence of a minimum threshold of cooperative individuals [START_REF] Pacheco | Evolutionary dynamics of collective action in N-person stag hunt dilemmas[END_REF][START_REF] Souza | Evolution of cooperation under N-person snowdrift games[END_REF][START_REF] Francisco | Risk of collective failure provides an escape from the tragedy of the commons[END_REF]. Despite its peculiarity, the game is sometimes considered as a particular type of public goods game.

More recently, a generalization of the hawk-dove game to multiple interacting players was proposed [START_REF] Chen | Evolutionary dynamics of n-person hawkdove games[END_REF]. In particular, whereas in the corresponding pairwise settings the game is considered equivalent to the snowdrift game, this is not true when interactions occur between groups of players. In particular, while in the snowdrift game the accomplishment of the task benefits all individuals, in the hawk-dove problem only strategists of a particular kind (hawks) benefit from the shared resource, excluding the opponent type (dove) from the distribution, unless a sufficiently high number of cooperative doves is present in the group. The emerging evolutionary dynamics is very rich: different scenarios associated to dominating hawks, coexistence, bi-stability, multiple interior equilibria and dominating doves can be obtained as a function of the dynamical parameters describing the resource to be shared, cost and minimum number of doves in a group for prosocial individuals to benefit.

The games discussed so far are multiplayer generalizations of pairwise dilemmas described by the payoff matrix in Eq. [START_REF] Orsini | Quantifying randomness in real networks[END_REF]. It is worth to mention that also different families of pairwise games have been investigated in the setting of wider group interactions. An example is that of the ultimatum game, where two players, one acting as a proposer and one as a receiver of an offer, bargain to split a sum of money [START_REF] Güth | An experimental analysis of ultimatum bargaining[END_REF][START_REF] Sinatra | The ultimatum game in complex networks[END_REF]. In the multiplayer case, offers can have an arbitrary number of receivers, who can reject or accept the proposal individually. Similarly to a threshold model [START_REF] Granovetter | Threshold models of collective behavior[END_REF], the offer is accepted and shared equally among responders only if the number of individual acceptances is above a given threshold. The game is significantly affected by the value of this parameter, with higher values associated to more generous and fair outcomes [START_REF] Fernando P Santos | Evolutionary dynamics of group fairness[END_REF].

B. Games with higher-order interactions

Public goods game on bipartite networks

Networked implementations of multiplayer games discussed so far lack control on the real higher-order structure of interactions. For instance, a scale-free degree distribution P (k) ∼ k -γ generates a similarly heavy-tailed distribution of group sizes P (G). This is not a realistic feature of many real social networks, such as collaboration networks, where individuals tend to collaborate together in fairly small groups of homogeneous size [START_REF] José | Self-organization of collaboration networks[END_REF].

Motivated by this finding, in Ref. [START_REF] Gomez-Gardenes | Evolutionary games defined at the network mesoscale: The public goods game[END_REF] Gómez-Gardeñes et al. studied the public goods game on an empirical bipartite network of scientific collaborations, where the two sets of nodes describe respectively scientists and papers. The authors compare the results with what obtained by implementing the game on the corresponding one-mode projection, acting as a null-model, where scientists who co-authored at least a paper are linked together, as shown in Figs. 35A,B. The main finding is that-no matter the details of the updating rule for the evolutionary dynamicscooperation is systematically enhanced by considering the real higher-order structure described by the bipartite network. This is due to the interplay between the heterogeneous distributions of the number of games in which each player is involved, and the homogeneous distribution of the groups. Taken together, these two features allow for the existence of a fairly high number of agents with high payoff involved in small groups, making this scenario responsible for further promoting prosocial behavior.

Enhanced cooperation with respect to the one-mode projection is observed consistently in both settings of fixed cost per game (Fig. 35C) and fixed cost per individual (Fig. 35D): the degree of cooperation is always greater when fixed costs per individual are considered rather than fixed costs per game, consistently with what found for classical monopartite networks, though the differences are now smaller. The boost in cooperation for fixed cost per individual is linked to the long tail in the distribution of degrees and number of games. However, this effect is mitigated when the real structure is considered. This can be understood by considering the agents who participate in a single collaboration, whose contribution is the same in the bipartite network both for fixed cost per individual and fixed cost per game scenarios, while this is not the same in the projected one-mode network where a node in general participates in k + 1 groups. Interestingly, the authors remark that the final cost per individual is a better setting to model collaborations, where researchers have a limited amount of time to be shared among parallel projects, and where those involved in only a few collaborations tend to take most of the workload. Finally, increasing the number of members of a group leads to a decrease of the level of cooperation in a population.

In a following work, Gómez-Gardeñes et al. deepen their investigations of higher-order structure by studying the effect of bipartite networks which have groups of the same sizes, but where the number of groups in which which a player can participate is a tunable parameter [START_REF] Gómez-Gardeñes | Disentangling social and group heterogeneities: Public goods games on complex networks[END_REF]. Surprisingly, the average level of cooperation achieved with homogeneous connectivity is remarkably larger than that for scale-free substrates. This finding indicates that the ability of scale-free networks to outperform the promotion of cooperators in homogeneous structures, first discussed in Ref. [START_REF] Francisco | Scale-free networks provide a unifying framework for the emergence of cooperation[END_REF], is not directly linked to the fat-tail in the distributions of number of games per player. At difference, instead, it rather depends on the entanglement of social and group heterogeneities which is unavoidable in the onemode projection. Further analyses on the impact of different distributions for group sizes and the number of individual contacts reveal the importance of overlap between groups for cooperation, similarly to the role of clustering on onemode projected networks [START_REF] Peña | Bipartite graphs as models of population structures in evolutionary multiplayer games[END_REF].

An interesting modification of the game considers the possibility that information on the earnings is shared between groups. This can be done by introducing an effective payoff, where the normal payoff associated to a member playing in a group is combined with the earnings of the same agents from the other groups in which it participates. The strength of this second term can be tuned with a parameter α, which describes the degree of cross-information among groups. Interestingly, information exchange is positively correlated with an enhancement of the cooperation in the system [START_REF] Gracia-Lazaro | Intergroup information exchange drives cooperation in the public goods game[END_REF]. The positive effect induced by cross-information is analogous to that of interdependent network reciprocity for multiplex networks, where individual payoffs are aggregated across the layers of the system.

Public goods game on hypergraphs

Recently, Alvarez-Rodriguez et al. introduced a new formalism to describe the evolutionary dynamics of higherorder interactions [START_REF] Alvarez-Rodriguez | Evolutionary dynamics of higher-order interactions[END_REF]. In this set up, groups of individuals are described by the hyperlinks of a hypergraph, making explicit the lift of interaction networks to the case of non-dyadic interactions. The Monte Carlo implementation of the dynamic is illustrated in Figs. 36A-C. In the manuscript, the authors finally normalize the payoffs by the number of played games, in an implementation reminiscent of the fixed cost per game scenario. The update process is also modified, and i imitates the strategy of its best performing neighbor k with a probability which depends on the difference π i -π k .

The stable state achieved from the evolutionary dynamics is first studied on uniform random hypergraphs, where all players are involved in the same number of hyperlinks of equal size, G = 2, . . . , 5. Figure 37A shows the fraction of cooperators x c as a function of the reduced synergy factor r, where the hyperdegree of each node is the minimum one to guarantee a connected hypergraph. As shown, the presence of larger groups promotes the onset of cooperation in more adverse conditions described by a low value of r. When density increases-no matter the group size-the hypergraph implementation of the public goods game converges to the limit of well-mixed population, as shown in Fig. 37B. Besides, the relaxation time T of the dynamics can be computed with good analytical accuracy with a mean-field approach.

The introduced formalism also allows for an analytical treatment of heterogeneous random hypergraphs, where nodes participate in groups of different order with a weight described by a probability distribution. For simplicity, the authors focus on heterogeneous hypergraphs with a different frequency of groups f G of order from 2 to 5 and ∑ G f G = 1, giving rise to 35 different hypergraphs classes. In this set-up, it is interesting to investigate the collective outcome of the game in scenarios where larger or smaller collaborations can be more or less effective. These different conditions are easily described by setting the synergy factor R to be a function of the group size G, i.e.

R(G) = αG β , (64)
where α > 0 and β ≥ 0 and different from 1. The emergence of cooperation is in general affected by both parameters α and β. In the particular case β = 1, all classes of hypergraphs show the same behavior as a function of α (Fig. 37C). This is not true for different values of the exponent, such as β = 2 (Fig. 37D). Besides, the average relaxation time T of the dynamics as a function of the critical point α c for the emergence of cooperation scales linearly with α if β ≠ 1. Interestingly, while a degeneracy is observed for β ≤ 1, this is broken for the superlinear case. This means that it is possible to exploit this additional degree of freedom by choosing an adequate hypergraph to set independently a chosen critical point and relaxation time.

Finally, the authors considered several datasets describing synergies and group tasks in the real-world. By imagining that these collaborations-ideally described by a public goods game-evolved over time to produce an optimal hypergraph structure and that a coordination cost is added to sustain too large collaborations, they inferred the ideal synergy factor associated to prosocial behavior. As an example, results for collaborations among physicists publishing in different journals of the American Physical Society are shown in Fig. 37E). Journals in experimental and applied physics typically have an optimal synergy factor for larger values of the group size G.

To conclude, even more than for the dynamical processes considered in Sections (5-7), the landscape of HOrSs in the field of social dilemmas is still widely unexplored. In the future, we foresee that an explicit treatment of higher-order interactions could be applied to the many games discussed in Section (VIII A 2), as well as others such as the naming game [START_REF] Baronchelli | Sharp transition towards shared vocabularies in multi-agent systems[END_REF][START_REF] Baronchelli | Topology-induced coarsening in language games[END_REF], the sender-receiver game [START_REF] Gneezy | Deception: The role of consequences[END_REF][START_REF] Valerio Capraro | The evolution of lying in well-mixed populations[END_REF][START_REF] Valerio Capraro | Lying on networks: The role of structure and topology in promoting honesty[END_REF], or problems of collective risk [START_REF] Milinski | The collectiverisk social dilemma and the prevention of simulated dangerous climate change[END_REF].

IX. APPLICATIONS

Non-pairwise interactions are common in various types of systems in the real world. Important examples include group interactions in both offline and online social networks [START_REF] Wasserman | Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)[END_REF][START_REF] Linton | Q-analysis and the structure of friendship networks[END_REF][START_REF] Andjelković | Hierarchical sequencing of online social graphs[END_REF], multi-authors scientific collaborations [START_REF] Patania | The shape of collaborations[END_REF], network motifs in transcription networks [START_REF] Mangan | Structure and function of the feed-forward loop network motif[END_REF] and trigenic interactions in gene regulatory networks [START_REF] Kuzmin | Systematic analysis of complex genetic interactions[END_REF], beyond pairwise mechanisms of species coexistence in ecological communities [START_REF] Levine | Beyond pairwise mechanisms of species coexistence in complex communities[END_REF], and higher-order correlations in neuronal [START_REF] Schneidman | Network information and connected correlations[END_REF] and whole-brain functional patterns [START_REF] Petri | Homological scaffolds of brain functional networks[END_REF][START_REF] Ibáñez-Marcelo | Topology highlights mesoscopic functional equivalence between imagery and perception: The case of hypnotizability[END_REF]. In this section, we present a selection of some of the possible applications of HorSs in fields spanning from social sciences to neuroscience and biology.

A. Social systems

Social scientists have realized since long time the importance of hypergraphs and simplicial complexes to describe and study affiliation data [START_REF] Wasserman | Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)[END_REF]. Affiliation networks, also known as membership networks, are a special kind of twomode social networks representing the affiliation of a set of n actors to a set of m events, or social occasions. As an example, Fig. 38A shows the bipartite network of the attendance of n = 6 children to m = 3 birthday parties. This system can be naturally described as a hypergraph whose nodes are the children and the hyperedges are the set of events (panel b). Notice that the data can be represented equally well by the dual hypergraph, obtained by reversing the roles of nodes and edges (panel c). In this latter case the three nodes are the three parties, while each child is a hyperdegree.

The literature on applications of hypergraphs and simplicial complexes in the social sciences is vast. We will then limit our survey to the pioneering works and to some recent results. Ref. [START_REF] Mcpherson | Hypernetwork sampling: Duality and differentiation among voluntary organizations[END_REF] presents one of the earliest use of hypergraphs to investigate affiliation to voluntary organizations. The work focuses on the issue of sampling and proposes estimators for the number and size distribution of organizations in cities, the density of relations among individuals generated by organizations, and the amount of membership overlap among organizations. Such estimators are then applied to data from a sample of individuals in different towns of the state of Nebraska. Results show that, while the mean affiliation rate does not systematically vary from city to city, the number of inter-organizational links per organization increases with the size of the city. Hypergraphs have also been used to capture the characteristic fluidity of urban social structures arising from collections of overlapping subsets such as voluntary associations, ethnic groups, action sets, and quasi-groups [START_REF] Foster | Urban structures derived from collections of overlapping subsets[END_REF], and to study participation of Thai households to ritual celebrations [START_REF] Foster | Overlap structure of ceremonial events in two Thai villages[END_REF].

Ref.

[603] discusses the conceptualization, measurement, and interpretation of centrality in affiliation networks. The main underlying assumption is that, in an affiliation network, also the events can acquire and transmit centrality. Ref. [START_REF] Bonacich | Hyper-edges and multidimensional centrality[END_REF] shows how centrality can be adapted to HOrSs and can turn very useful to capture important properties of real-world systems. The measures proposed in this work are extensions of the Bonacich eigenvector centrality [START_REF] Bonacich | Factoring and weighting approaches to status scores and clique identification[END_REF][START_REF] Bonacich | Simultaneous group and individual centralities[END_REF][START_REF] Bonacich | Power and centrality: A family of measures[END_REF] to the case of hypergraphs (see also Section III B). The basic idea is simple. Let I be the incidence matrix of a hypergraph. If we indicate as vectors x and y the centrality scores for the rows and columns, representing the hyperedges and the nodes of the hypergraph respectively, we can write that: I T x = λy and Iy = λx, which means assuming that individuals acquire their centrality by attending important events, and important events are attended by central individuals. The vectors x and y are then eigenvectors of two different matrices, although both are associated with the same eigenvalue λ 2 :

II T x = λ 2 x I T Iy = λ 2 y ( 65
)
The final outcome is a measure of centrality for events, as well as an improved measure of centrality for actors. The authors of the paper show an application to study data describing 56 attacks on European settlements occurred between the years 1509 and 1700 and involving Caraibe from 22 different islands. Such data require a description considering more-than-dyadic interaction, as attacks could involve more than two islands at the same time.

Simplices and simplicial complexes provide an alternative way to describe and study membership networks using methods from algebraic topology. This approach draws heavily on the pioneering ideas of Ron Atkin [START_REF] Atkin | Mathematical Structure in Human Affairs[END_REF][START_REF] Wylie | Mathematical structure in human affairs[END_REF] and on his q-analysis, which makes use of a geometric interpretation of the relationships between actors and events. Atkin's framework to study social systems is based on a fundamental distinction between what he calls the "backcloth" of social action, namely the structure of ties among the events, and the "traffic" of social activities that can take place over the backcloth, such as the formation of pairwise acquaintanceship between actors. The backcloth is a simplicial complex and the q-analysis is designed to describe the patterns of relations among its constituents.

To give a concrete example, we will discuss here an application of Atkin's framework to study the formation of friendship in a scientific community against the backcloth of shared contacts [START_REF] Linton | Q-analysis and the structure of friendship networks[END_REF]. In his analysis of friendship among a set of 29 social science researchers, Linton Freeman looked at 19 linking events corresponding to scientists been located in the same university department at the same time, or having attended conferences together. Each person is then represented as a simplex of the linking events in which has been involved. 25 of the 29 persons participated at least to one of the 19 events, with 13 of them involved in only one event. These persons are 0-simplices, but there are also six 1-simplices (pairs of events), and four 2-simplices (persons involved in three linking events). The highest order simplices found are two 3-dimensional tetrahedrons. These simplices form the building blocks for the construction of a backcloth for social action. The basic idea is that conferences and universities provide the perfect setting in which friendships between academics can be developed. Therefore to understand the formation of social ties it is important to analyze how the simplices are intertwined into a larger structure, i.e. into a simplicial complex. The simplicial complex corresponding to the system under study is shown in Fig. 39A. The linking events are the nodes of the simplicial complex and are labeled with a number from 1 to 19. The persons are instead indicated with the symbols P 1 -P 29 and can either be represented as nodes, links, or higher order objects. Notice the two tetrahedrons showing the q-analysis of the simplicial complex. The first column is the dimension of components made up of chains of simplices. The second column is the number of chains at each level, while the third column reports the names of the simplices making up each chain. Figure and table reproduced from Ref. [START_REF] Linton | Q-analysis and the structure of friendship networks[END_REF] .

respectively corresponding to persons P 13 = {11, 13, 15, 16} and P 3 = {2, 8, 9, 19}. These are the highest-order simplices present in the simplicial complex, which can then be well represented in three dimensions. Two persons can share one or more common linking events. For instance, person P 20 is linked at dimension 0 to person P 4 since they have only a node (event 3) in common. Person P 13 and P 21 are instead linked by two events (nodes 8 and 9). Hence they are 1-connected, as they are glued together by a 1-dimensional line (the edge 8-9). What matter are not only direct connections between simplices, but also chains of connections. For instance, the three simplices P 4 , P 9 and P 20 are linked in a chain of connection of order 0, as P 4 is 0-connected to P 20 , and P 20 is 0-connected to P 9 . Instead P 13 , P 9 and P 20 are in the same 1-connected component. Atkin's q-analysis describes the sets of chains of connection and their dimensions. The table in Fig. 39B tells us that there are three components at dimension 0, with the largest one containing 21 of the 25 persons. Moreover, there are nine components at dimension 1: the largest one made by P 13 , P 9 and P 20 , the second one by P 2 and P 28 , and seven isolated 1-dimensional simplices (edges). No connections (of any type) are instead observed among simplices of dimension larger than 1. Another interesting feature of the simplicial complex is the existence of a 0-dimensional q-hole (akin to a H 1 cycle, see Section III D) involving the four persons P 9 , P 11 , P 13 and P 20 and shown as a shaded area in Fig. 39A. This corresponds to a cycle of four nodes only pairwise connected and is an indication of an obstruction to the free flow of social traffic on the backcloth. The main purpose of Freeman was to correlate the formation of personal friendships to the structure of the backcloth. He had data of 12 close mutual friendships reported by the 29 researchers. And he was indeed able to show that the structure of the backcloth constrains the choice of personal friends. In fact, none of the 12 existing social links was among the pairs prohibited by the obstructions in the backcloth. Moreover, 11 of these 12 pairs were among the 31 adjacent pairs which are 0-adjacent in the backcloth.

A similar application of q-analysis to study the evolution of social groups has been published by Patrick Doreian in the same years [START_REF] Doreian | On the evolution of group and network structure[END_REF]. Doreian had data on the participation of 18 women in 14 events through time, and used q-connectivity to trace the group structure over time. His primary objective was to investigate conflict within the group and eventually predict the observed split of the group of women into two subgroups. Differently from Ref. [START_REF] Linton | Q-analysis and the structure of friendship networks[END_REF], the approach here is dynamic: the q-connectivity analysis is applied to an enlarging set of of successive events in time.

Although, on the one hand, the work confirmed that algebraic topological approaches are flexible enough to provide a description of structural changes, on the other hand the results showed that the data used were not rich enough to explain the observed changes. This also pointed to the importance of collecting high-resolution temporal data [START_REF] Holme | Temporal networks[END_REF].

Certainly one of the most original applications of simplicial complexes to social networks is the structural analysis of a team sport presented in Ref. [START_REF] Gould | A structural analysis of a game: The Liverpool v Manchester united cup final of 1977[END_REF]. In their work, Gould and Gatrell used Atkin's q-analysis to define and characterize intuitive notions of structure in a soccer match. They focused on the England FA Cup Final between Liverpool and Manchester United played on 21 May 1977 at Wembley Stadium, London. Although commentators generally rated the play of Liverpool as superior, Manchester United won the match by 2 goals to 1. The authors considered the 22 players and defined a relation in this set using a variable threshold on the number of times the ball passed from one player to another. Then they examined the internal structure of the two teams separately, and also the relations between the two sets of players, defined by the loss of the ball by one team to the other. The analysis is able to show the relevance and role of different players and group of players. The results also indicate that the injection of q-holes by the defense of the Manchester United, created an obstruction to the free flow, contributing to the fragmentation and loss of the Liverpool. It could be very instructive to apply and validate this type of analysis on a larger scale, now that soccer analytics is attracting increasing interest and detailed data on all the spatio-temporal events (passes, shots, fouls, etc.) occurring during a match are available for entire seasons and different soccer competitions [START_REF] Pappalardo | A public data set of spatio-temporal match events in soccer competitions[END_REF].

More recently, simplicial complexes have also been used to investigate online social networks [START_REF] Andjelković | Hierarchical sequencing of online social graphs[END_REF][START_REF] Gao | Studying the utility preservation in social network anonymization via persistent homology[END_REF] and social resource sharing systems [START_REF] Catutto | Network properties of folksonomies[END_REF]. For instance, the authors of Ref. [START_REF] Andjelković | Hierarchical sequencing of online social graphs[END_REF] have assessed the role of an individual in MySpace computing what they name the node structure vector, which allows to characterize the topological space around a node. This is defined, for a node i, as the vector Q i = {Q i 0 , Q i 1 , . . . , Q i dmax } whose d max + 1 components denote respectively the generalized node degree k d,0 (i) of order d introduced in Section III B, i.e. the number of d-dimensional simplices, with d = 0, 1, . . . , q max , to which node i participates, and d max is the dimension of the largest simplex in the complex. The study of the simplicial node degree k

(i) = ∑ dmax d=0 Q i d = ∑ dmax d=0 k d,0 (
i), also known as the node topological dimension, provides a good measure of the social capital of the corresponding individual. In fact, it has been found that the so called Simmelian brokerage [START_REF] Latora | Social cohesion, structural holes, and a tale of two measures[END_REF], which quantifies a node's ability to act as a broker in a community, scales as a power of the node topological dimension. Moreover, the analysis of the components of the node vector over the different social layers and communities of MySpace reveals that influential individuals connects higher-order simplices and build their social capital by combining their connections in different layers.

Authorship of scientific articles is a particularly interesting type of affiliation networks, as it provides important insights on patterns of collaboration within the academic community. In this case, the two sets of nodes represent scientists and their publications, respectively. The basic units of scientific collaborations and of the social network of acquaintances among scientists are co-authored publications, which often involve groups of authors rather than just two [START_REF] Milojević | Principles of scientific research team formation and evolution[END_REF][START_REF] Quan | Node importance measure for scientific research collaboration from hypernetwork perspective[END_REF]. Hence, in their study on the "shape of scientific collaborations", the authors of Ref. [START_REF] Patania | The shape of collaborations[END_REF] have proposed to complement the results that have been obtained by methods of network analysis [START_REF] Newman | Scientific collaboration networks. I. Network construction and fundamental results[END_REF][START_REF] Newman | Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality[END_REF][START_REF] Newman | The structure of scientific collaboration networks[END_REF] with an approach based on a simplicial description of scientific publications and on the use of tools from algebraic topology. They have considered all the papers posted on the arXiv, a repository of electronic preprints spanning from physics to quantitative biology and mathematical finance, in the period 2007-2016, and have constructed 18 different simplicial complexes, one for each of the different categories of arXiv. Each paper with k authors corresponds to a (k -1)simplex, and only papers with author sets not fully contained in the author sets of other papers have been retained in the construction of the simplicial complexes in order to preserve their basic structural properties. Both the size distribution of facets (maximal simplices, see Section II) P (s) and the simplicial node degree distributions P (d) of the complexes display broad tails, indicating the presence of large collaborations and of authors with a large number of different collaborations, respectively. The 18 different categories can then be grouped in only two large classes based on their P (d), showing that the number of collaborations to which an author is able to participate is quite well conserved across fields. Also, all the 1-dimensional homological cycles, i.e. the two-dimensional holes bounded by edges, of the various co-authorship simplicial complexes have been studied. In particular, focusing on the shortest possible cycles, triangles, and counting how many of the set of three edges arranged in a triangle are covered by a full triangle (2-simplex), allows to investigate the concept of simplicial closure (the extension of triadic closure to simplicial complexes [START_REF] Bianconi | Triadic closure as a basic generating mechanism of communities in complex networks[END_REF]) in the data. Results indicate the presence of very strong simplicial closure for all categories of arXiv, meaning that in the great majority of cases whenever three authors have collaborated in pairs, they also have collaborated on a paper together. An application to collaboration networks of a similar extension to hypergraphs of the concept of clustering coefficient, and of that of subgraph centrality can be found in Ref. [START_REF] Estrada | Subgraph centrality and clustering in complex hyper-networks[END_REF].

B. Neuroscience and brain networks

Lively debated over the last decade, the question of whether high-order correlations -in addition to the basic pairwise interactions-were needed to properly account for brain function was met with strong evidence of a positive answer. Using higher-order connected correlation functions [START_REF] Schneidman | Network information and connected correlations[END_REF], Schneidman et al. [START_REF] Schneidman | Weak pairwise correlations imply strongly correlated network states in a neural population[END_REF] revealed that high-order correlations exist in neural populations. Similarly, Ganmor et al. [START_REF] Ganmor | Sparse low-order interaction network underlies a highly correlated and learnable neural population code[END_REF] and Yu et al. [START_REF] Yu | Higher-order interactions characterized in cortical activity[END_REF] provided evidence that introducing higher-order interactions between neurons allowed to improve the predictions at mesoscopic scales, e.g. for cortical dynamics such as neuronal avalanches in the awake monkeys or visual responses in the anesthetized cats. More recently, further research in neural spike trains provided methods to measure the strengths of multi-spike interactions [START_REF] Shimazaki | State-space analysis of time-varying higher-order spike correlation for multiple neural spike train data[END_REF], and showed their importance in shaping the dynamics of cortical columns [START_REF] Köster | Modeling higher-order correlations within cortical microcolumns[END_REF] and in population coding [START_REF] Shimazaki | Simultaneous silence organizes structured higher-order interactions in neural populations[END_REF][START_REF] Cayco-Gajic | Triplet correlations among similarly tuned cells impact population coding[END_REF].

The models used to estimate higher-order interactions in the cases mentioned above are usually tailored after the generalized Ising model [START_REF] Schneidman | Weak pairwise correlations imply strongly correlated network states in a neural population[END_REF]. In these models, the probability of observing a pattern of firing neurons (σ 0 , σ 1 , . . . , σ n ) is given by

P (σ 0 , σ 1 , . . . , σ n ) = 1 Z exp ⎛ ⎝ i α i σ i + i<j β ij σ i σ j + i<j<k γ ijk σ i σ j σ k + . . . ⎞ ⎠ (66)
where α, β, γ, . . . control the self-, pairwise-and third-order interactions among firing units. These models, while very powerful, have several limitations. First, they are designed for systems with discrete states. Neurons are usually considered to be firing or quiescent so are well described by Ising spins, which take values ±1. Conversely, continuous data (e.g. local field potentials, EEG or BOLD signals) need to be binarized to be amenable to this type of analysis, and this can represent an important problem when we want to deal with macroscopic brain networks. Second, and more importantly, these models neglect the information encoded in the spatial and temporal structure of the interactions. Third, their scalability to large networks is made more complicated by the requirement of large amounts of data (e.g. long timeseries) to estimate model parameters.

Against this context, Giusti et al. [START_REF] Giusti | Clique topology reveals intrinsic geometric structure in neural correlations[END_REF] studied how the correlations of spike trains can be used to detect intrinsic structures in neural activity, without recurring to external stimuli or receptive fields, and how they relate to the topology and geometry of the animal's space. In particular, they computed pairwise correlations from the crosscorrelograms of pyramidal neurons in freely roaming mice. Each correlation matrix was then transformed into an order complex. This is a filtration of simplicial complexes, obtained in their stead from a sequence of progressively denser graphs. At each density, only the strongest edges until the fixed density were retained. In such a way, for each density a binary graph was built and the corresponding clique complex computed, that is, in each graph all the cliques were considered as simplices (Fig. 40A). Giusti et al. [START_REF] Giusti | Clique topology reveals intrinsic geometric structure in neural correlations[END_REF] then compared the Betti curves of the real order complex with those obtained from randomized versions, which were built by reshuffling the original correlation matrices. They found that the Betti curves, which encode the topological complexity of the cell activation patterns, displayed consistently lower values than those from the randomized models. These observations implied that the correlation structure of hippocampal neurons intrinsically represented the low dimensional input space (a two-dimensional roaming space in this case).

These results confirmed previous evidence on the role of hippocampal place cells in encoding primarily a space's topological qualities rather than its geometry [START_REF] Dabaghian | A topological paradigm for hippocampal spatial map formation using persistent homology[END_REF][START_REF] Dabaghian | Reconceiving the hippocampal map as a topological template[END_REF], but also showed that some coarse geometrical information can be encoded in the fabric of correlations. Even more interestingly, Babichev et al. [START_REF] Babichev | Robust spatial memory maps encoded by networks with transient connections[END_REF] extended previous hypotheses FIG. [START_REF] Lancichinetti | Limits of modularity maximization in community detection[END_REF]. The structure of coactivation complexes. (A) Simulated place field map M ( ) of a small planar environment with a hole in the center. The series of snapshots illustrates the temporal dynamics of the coactivity complex: the complex goes from being from small and fragmented, in the early part of the exploration, to becoming a stable representation of the shape of the underlying environment. (B) The timelines, encoded as barcodes, of topological persistent H0 and H1 cycles in the coactivity simplicial complex: 0-dimensional persistent generators are shown in light-blue lines, 1-dimensional ones in light-green. Most loops correspond to accidental, short-lasting structures, effectively representing noise in the complex. The persistent topological loops (marked by red dots) represent physical features of the environment. The time to eliminate the spurious cycles can be used as a theoretical estimate of the minimal time needed to learn the path connectivity of . (C) Simplices can also disappear, and hence the coactivity complex may be flickering, instead of stable. (D) The timelines of the topological cycles in such complex may remain interrupted by opening and closing topological gaps produced by decays and reinstatements of its simplices. Figures reproduced from Ref. [START_REF] Babichev | Robust spatial memory maps encoded by networks with transient connections[END_REF].

on the topological nature of the hippocampal map [START_REF] Dabaghian | A topological paradigm for hippocampal spatial map formation using persistent homology[END_REF][START_REF] Dabaghian | Reconceiving the hippocampal map as a topological template[END_REF] to account for the temporal nature of interactions among place cells. Indeed, the mammalian hippocampus is thought to be able to learn an internalized cognitive map representing the ambient space. It is however unclear how such a map is conserved in time and updated due to the transient nature of synaptic connections and of the downstream neuronal networks. To investigate this mechanism, Babichev et al. [START_REF] Babichev | Robust spatial memory maps encoded by networks with transient connections[END_REF] represented the instantaneous state of the internalized map as a coactivity complex, in which simplices represent groups of coactive place cells. At the beginning only few groups of place cells, hence simplices, are present. In time however by accumulation of activity, the coactivity complex should approximate the topology of the underlying space in which the animal moves. An open question however is how it is possible to preserve a consistent representation of a space while the animal is moving, place cells are constantly remapping and in general the population coding fluctuates. Studying the robustness of the topological features of coactivity complexes, Babichev et al. [START_REF] Babichev | Robust spatial memory maps encoded by networks with transient connections[END_REF] strongly suggested that the temporal stability of the hippocampal map is a generic phenomenon stemming from a compensatory mechanism in which neuronal activity compensates deterioration in the network structure to preserve hippocampal function.

Reimann et al. [START_REF] Michael W Reimann | Cliques of neurons bound into cavities provide a missing link between structure and function[END_REF] investigated the topology of excitation networks built from simulated activity on reconstructed cortical micro-circuitry. They found that different stimuli elicited a surprisingly large number of high-dimensional directed cliques and created a wide variety of high-dimensional homological holes. In particular, simulations on a variety of synthetic and null models did not display such an array of topological responses, suggesting these topological metrics do not emerge from traditional constraints on graph structure (e.g. degree sequences, clustering, etc..), but rather from particular species-specific coordination among links. Moreover, they observed also that, in response to sensory stimuli, pairwise correlations grew with the number and order of the simplices to which the neurons belonged, suggesting that the hierarchy in physical structure results in hierarchically correlated activities.

At the macroscopic brain network level, the question of the importance (or lack thereof) of higher-order interactions appears less settled. On the one hand, for example, Huang et al. [START_REF] Huang | Weak higher-order interactions in macroscopic functional networks of the resting brain[END_REF] suggested that weak higher order interactions might indeed be present in macroscopic functional networks, but also that, due their weakness, pairwise interactions are dominant in shaping brain activities, hence justifying functional connectivity descriptions based on pairwise interactions alone. On the other hand instead, higher order features were shown to be reliable under test-retest analysis [START_REF] Zhang | Test-retest reliability of "high-order" functional connectivity in young healthy adults[END_REF], and important as indicators of aberrant connectivity in mental disorders [START_REF] Sergey M Plis | High-order interactions observed in multi-task intrinsic networks are dominant indicators of aberrant brain function in schizophrenia[END_REF] and mild cognitive impairment [START_REF] Zhang | Topographical information-based high-order functional connectivity and its application in abnormality detection for mild cognitive impairment[END_REF]. Also, higher order interactions were useful in the inference of the parameters of coupled oscillator models of EEG signals (for example [START_REF] Kralemann | Reconstructing effective phase connectivity of oscillator networks from observations[END_REF]), which we discussed in more detail in VI C.

Recent seminal research has shown the potential and impact of topological approaches, in particular those inspired by topological data analysis. Structurally, persistent homology techniques were adopted to describe and discriminate healthy and pathological states in developmental [START_REF] Lee | Integrated multimodal network approach to PET and MRI based on multidimensional persistent homology[END_REF] and neurodegenerative diseases [START_REF] Lee | Hole detection in metabolic connectivity of Alzheimer's disease using k-Laplacian[END_REF]. Sizemore et al. [START_REF] Sizemore | Cliques and cavities in the human connectome[END_REF] described the white matter network of fibers between brain regions as a weighted network and then studied both its dense portions, in terms of cliques, and its cavities, in terms of homology. They found that large cliques are much more frequent than expected in an appropriate randomized model built using biologically-inspired principles of parsimonious wiring (Fig. 42A). These cliques were interpreted as local dense units able to perform rapid processing, and were found to be positioned around topological cavities, which in turn acted as obstructions and guides for the information flows. These cavities were also reproducible across subjects and appeared to connect regions belonging to different phases of brain evolutionary history (Fig. 42B). Similarly, Bendich et al. [START_REF] Bendich | Persistent homology analysis of brain artery trees[END_REF] described the morphology of brain arteries using topological observables. In particular, using persistent homology of trees, they characterized arterial morphology using the structure of branching and looping of vessels at multiple scales, and found distinctly different patterns at different ages. Topological differences have been also found at both population and individual levels in functional connectivity in healthy and pathological subjects [START_REF] Lee | Persistent brain network homology from the perspective of dendrogram[END_REF][START_REF] Lee | Discriminative persistent homology of brain networks[END_REF]. Higher dimensional topological features have been employed to detect differences in brain functional configurations in neuropsychiatric disorders and altered states of consciousness relative to controls [START_REF] Petri | Homological scaffolds of brain functional networks[END_REF][START_REF] Moo K Chung | Exact topological inference for paired brain networks via persistent homology[END_REF], and to characterize intrinsic geometric structures in neural correlations [START_REF] Giusti | Clique topology reveals intrinsic geometric structure in neural correlations[END_REF][START_REF] Rybakken | Decoding of neural data using cohomological feature extraction[END_REF].

As an example, Petri et al. [START_REF] Petri | Homological scaffolds of brain functional networks[END_REF] compared the topology of the functional connectivity of subjects that had been subministrated with psilocybin, a psychedelic drug, with their own under placebo. They found that the topological structure of the two conditions was very different and such difference could be quantified already at the level of persistence diagrams (Fig. 42C). While the difference between topological summaries. obtained from persistent homology, was already discernible, it provided little information on how topological information mapped back to the underlying brain regions. The authors solved this problem by defining a topological backbone, called scaffold, built on approximated minimal homological generators (Fig. 42D), which allowed them to show that altered states of consciousness induced by psilocybin (and likely, other psychedelics) stem from very different patterns of information integration and importance of the brain regions [START_REF] Lord | Insights into brain architectures from the homological scaffolds of functional connectivity networks[END_REF] with respect to the normal state (Fig. 42E). Other examples can be found in the following series of works. Lee et al. [START_REF] Lee | Discriminative persistent homology of brain networks[END_REF] have proposed methods to discriminate between cohorts of children with attention deficit hyperactivity disorder, autism spectrum disorder and pediatric control subjects on the basis of their functional topology. Lee et al. [START_REF] Lee | Harmonic holes as the submodules of brain network and network dissimilarity[END_REF] instead represented the topological substructure of brain networks through the eigenvectors of the corresponding Hodge Laplacians and used it to discriminate between mild and progressive cognitive impairments, and Alzheimers disease. Chung et al. [START_REF] Moo K Chung | Exact topological inference of the resting-state brain networks in twins[END_REF] described the heritability of differences in whole-brain functional topology in a cohort of twins. Ibáñez-Marcelo et al. [START_REF] Ibáñez-Marcelo | Topology highlights mesoscopic functional equivalence between imagery and perception: The case of hypnotizability[END_REF] related the topological functional structure of EEG data during imagery to functional equivalence in a population of skilled versus unskilled imagers [START_REF] Ibáñez-Marcelo | Spectral and topological analyses of the cortical representation of the head position: Does hypnotizability matter?[END_REF].

Going beyond functional connectivity, Saggar et al. [START_REF] Saggar | Towards a new approach to reveal dynamical organization of the brain using topological data analysis[END_REF] constructed a simplified topological backbone representation of the full fMRI activation space and showed that the properties of these backbones associated with behavioral performance in a series of cognitive tasks. In the context of event-related fMRI, Ellis et al. [START_REF] Cameron T Ellis | Feasibility of topological data analysis for event-related fMRI[END_REF] investigated the feasibility of topological techniques for recovering signal representations from BOLD signals. In particular, they embedded specific signal configurations by a convolution of the signal with the hemodynamic response, showing that the persistent homology was able to recover the signal topology with high accuracy.

Finally, moving from neuroimaging to applications in cognitive neuroscience, Sizemore et al. [START_REF] Sizemore | Knowledge gaps in the early growth of semantic feature networks[END_REF] mapped the evolution of early semantic networks in toddlers by identifying words with nodes and considering higher order interactions among them. They found that sparse regions of the resulting HOrSs displayed remarkable similarities at the topological level across subjects, and the timing of their disappearance was more closely to the patterns of connections among words than to their actual semantic content, thus suggesting that knowledge acquisition might generally happen via filling knowledge gaps. For an extended review of the current research on the effects of non-pairwise interactions in neuroscience, we refer the reader to the following references [START_REF] Expert | Editorial: Topological neuroscience[END_REF][START_REF] Giusti | Two's company, three (or more) is a simplex[END_REF][START_REF] Sizemore | The importance of the whole: Topological data analysis for the network neuroscientist[END_REF].

C. Ecology

Higher-order interactions have been studied for decades in the context of ecological models [START_REF] Case | Testing for higher order interactions[END_REF][START_REF] Peter | Arguments in favor of higher order interactions[END_REF][START_REF] Kareiva | Special feature: Higher order interactions as a foil to reductionist ecology[END_REF]. However, only very recently it has been highlighted their crucial role for the stability of large ecological communities and for the remarkable biodiversity observed in nature. While pairwise interactions in ecology consider the direct effect, either positive or negative, of a species on another, as shown in Fig. 43A, high-order interactions include all the cases where the relation between two species can be modified by the presence of other species, which may also be not directly affecting the former [START_REF] Billick | Higher order interactions in ecological communities: What are they and how can they be detected?[END_REF][START_REF] Wootton | Indirect effects and habitat use in an intertidal community: Interaction chains and interaction modifications[END_REF]. For instance, this happens when there is a microbial species that produces an antibiotic to interfere with a competing species, and a third species produces an enzyme which degrades the antibiotic thus reducing the strength of the interaction among the other two [START_REF] Bairey | High-order species interactions shape ecosystem diversity[END_REF]. This is illustrated in Fig. 43B, where species 1 inhibits species 2, and species 3 produces the enzyme that reduces the direct inhibitory effect of species 1 on species 2. Such a mechanism gives rise to a so-called "trait-mediated indirect interactions" (TMIIs) between species 3 and 2, which is different from a possible direct pairwise interaction between 3 and 2 (also reported in the figure), being intrinsically a three-species interactions. As finally shown in Fig. 43C, the enzyme produced by species 3 can in turn can be inhibited by a compound introduced by a species 4, creating a four-species inseparable/entwined interaction, and so on [START_REF] Kelsic | Counteraction of antibiotic production and degradation stabilizes microbial communities[END_REF][START_REF] Michael H Perlin | Protection of Salmonella by ampicillin-resistant Escherichia coli in the presence of otherwise lethal drug concentrations[END_REF][START_REF] Monica I Abrudan | Socially mediated induction and suppression of antibiosis during bacterial coexistence[END_REF]. Similar effects can also arise from an adaptive behavior, for instance a predator which changes its target prey because another prey becomes available [START_REF] Koen-Alonso | A process-oriented approach to the multispecies functional response[END_REF]. In this case there is no direct interaction between the two preys but they are part of a hyper-interaction, and considering only pairwise interactions would not allow to correctly take into account this effect.

Analyses of ecological networks almost often omit non-pairwise interactions, many classes of which are instead fundamental to the structure, the function and the resilience of ecosystems. It has been shown that the class of threespecies interactions in which one of the three species has the effect of mitigating the negative interaction between the other two can have a stabilizing effect [START_REF] Kelsic | Counteraction of antibiotic production and degradation stabilizes microbial communities[END_REF], while it has been found that increasing the order of the interactions reduces the fraction of extinct species [START_REF] Viviane | Random replicators with high-order interactions[END_REF] and increases the variance of species abundances at equilibrium [START_REF] Yoshino | Rank abundance relations in evolutionary dynamics of random replicators[END_REF]. The literature is growing and many scientists have shown that higher-order interactions can have a stabilizing effect under many particular condition settings.

It has been shown that hypergraphs can be a very useful mathematical framework to represent and take into ac- count non-pairwise ecological interactions, such as TMIIs [START_REF] Estrada | Subgraph centrality and clustering in complex hyper-networks[END_REF][START_REF] Sonntag | Competition hypergraphs[END_REF][START_REF] Antonio J Golubski | Ecological networks over the edge: Hypergraph trait-mediated indirect interaction (TMII) structure[END_REF]]. As an illustrative example of the value of hypergraphs in describing ecological communities, the authors of Ref. [START_REF] Antonio J Golubski | Ecological networks over the edge: Hypergraph trait-mediated indirect interaction (TMII) structure[END_REF] have studied a real-world coffee agroecosystem in southern Mexico, in which resistance to agricultural pests depends upon a large number of TMIIs. Based on field studies, they have assembled the intricate web of interactions among agricultural pests that is reported in Fig. 44A. Black arrows indicate direct effects, while blue and red arrows represent modifications of those direct effects, and modifications of those modifications, respectively. In particular, some protective effects attributable to TMIIs imposed by ants of the genus Azteca (blue lines from node Azteca), some of which are further modified by antparasitizing phorid flies (three red lines from node Phorid), have been shown to be crucial for controlling agricultural pests. Interactions within this system can be well represented by an hypergraph. The hypergraph corresponding to key interactions involving the four nodes Phorid, Azteca, Scale and Beetle (Azya orbigera) is reported in Figs. 44B-G, together with its adjacency and incidence matrices. Notice that positive and negative direct effects, or strengthening and weakening TMIIs are respectively indicated by triangular and circular arrow-heads in the interaction web in the left panel. However, this information has been omitted to produce the simpler case of an undirected system shown in (B). Direct effects represented as black lines in (B), and corresponding to the three edge of the hypergraph, include beetles preying on scale insects (C), Azteca ants consuming energy from Scales (D), and Phorid flies parasitizing Azteca ants (E). Indirect effects, consisting of Azteca ants reducing the magnitude of the interaction between Scale and Beetle [dashed blue line in (B)], and Phorid flies reducing the magnitude of the effect of Azteca ants on the Scale-Beetle interaction [dashed red line in ()B)], are instead represented as the two hyperedges reported in (F) and (G), respectively. This example immediately illustrates the straightforward way in which hyperedges can represent TMIIs. The authors of Ref. [START_REF] Antonio J Golubski | Ecological networks over the edge: Hypergraph trait-mediated indirect interaction (TMII) structure[END_REF] further elaborate on how the analysis of hypergraph topology, and concepts such as shortest hyperpaths and hypergraph centrality measures, can turn very useful for studying important aspects of ecological systems (such as how a species is affected by the removal of other species from the system) that a network description only based on pairwise interactions alone can fail to faithfully represent.

Bairey et al. have investigated the stabilizing role of higher-order interactions in replicator equations [START_REF] Bairey | High-order species interactions shape ecosystem diversity[END_REF]. They have proposed a mathematical model based on random replicator dynamics to study ecosystems when both pairwise and higher-order interactions are present. An ecosystem is described at each time by its state x = (x 1 , x 2 , ..., x N ), where x i ≡ x i (t) denotes the abundance of species i at time t, with the physical constraint ∑ i x i (t) = 1∀t. The temporal evolution of the abundances are governed by the following set of differential equations:

ẋi = x i [f i (x) - N j=1 x j f j (x)] i = 1, . . . , N (67)
in the usual form of replicator dynamics [START_REF] Diederich | Replicators with random interactions: A solvable model[END_REF][START_REF] Hofbauer | Evolutionary Games and Population Dynamics[END_REF][START_REF] Opper | Replicator dynamics[END_REF][START_REF] Chawanya | Large-dimensional replicator equations with antisymmetric random interactions[END_REF], already introduced in Section VIII to model the evolutionary dynamics of strategic interactions. The first term in bracket, f i represents the fitness of species i, which depends on the effect of the other species through the system state x, while the second term is the average population fitness.

The key point is that the fitness function here adopted:

f i (x) = -x i +
includes pairwise but also higher-order interactions. Entry a ij of matrix A determines the effect of species j on species i. Three-dimensional (or third-order) tensor B rules three-species interactions, with the value of the entry b ijk determining the joint effect of species j and k on species i, and so on with the four-dimensional tensor C, etc. Notice that the negative sign of the first term, -x i , implies the stability of the system when interactions are turned off (species are self-limiting in high concentrations). Limiting the analysis to hyper-interactions not involving more than four species, random perturbations of different order to a stable ecosystem are then modeled by setting A = √ α Ã, B = √ β B and C = √ γ C. Here Ã, B and C are a random matrix (a two-dimensional tensor), and a random threedimensional and four-dimensional tensors respectively. The elements of Ã, B and C can either be positive or negative and are drawn from a Gaussian distribution with mean 0 and variance 1. The important parameters of the model are then the values of α, β and γ, which represent the strength of the pairwise, three-species and four-species interactions, respectively. As expected, in a system with only pairwise interactions (β = 0, γ = 0), species exhibit extinctions when the strength α is larger than a critical value, and such value decreases with the system diversity, i.e. with the number of species N . Reported in Fig. 45A is the threshold α c at which coexistence is lost in 5% of the simulations. When the number of species N is increased, the critical threshold α c decreases as 1 N , in agreement with the result by May [START_REF] Robert | Will a large complex system be stable?[END_REF]. The situation changes when higher order interactions are considered. In particular, if only three-species interactions are present (α = 0, γ = 0), then the value of the critical strength β c is not affected by the number of species. Conversely, if only four-species interactions are considered, the threshold γ c increases with the system diversity. This is a striking result: for a fixed strength of four-species interactions, an ecosystem is stabilized, rather than destabilized, as the number species increases. Thus, while pairwise interactions introduce a higher bound on diversity, a lower bound is instead created by high-order interactions. Or in other words while ecological communities with a large number of species become sensitive to pairwise interactions, communities with a small number of species are sensitive to high-order interactions.

Bairey et al. have also considered the more interesting "mixed case" in which a combination of the three types of interactions can be present at the same time. The resulting stability region for three different sizes N of the system is graphically represented in Fig. 45B. in the space (γ, α) of pairwise and four-species interaction strengths, in the case of no three-species interactions, i.e. assuming β = 0. Notice that there is a small area where an ecosystem with N = 8 species is feasible, while systems of both sizes N = 5 and N = 15 are unstable. Since it is plausible that, in the most general case, an ecosystem is characterized by interactions of different orders and by a set of values (α, β, γ, . . .) for the corresponding strengths, this will imply the existence of both a lower and upper bound for the number of species, for which Bairey et al. provide an analytical estimation. They also found that, if the total strength α + β + γ is increased, then upper and lower bounds get closer, restricting the range of allowed diversity of the ecosystem.

Grilli et al. [START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF] have instead studied the role of high-order interactions in a model of interacting competitors [START_REF] Vandermeer | The competitive structure of communities: An experimental approach with protozoa[END_REF][START_REF] Neill | The community matrix and interdependence of the competition coefficients[END_REF][START_REF] Carsten | Experimental evidence rejects pairwise modelling approach to coexistence in plant communities[END_REF][START_REF] Weigelt | Identifying mechanisms of competition in multi-species communities[END_REF]. Although the proposed framework is quite general, the model describes the dynamics of a forest with a large but 67) and ( 68) beyond which the coexistence of species is lost as a function of the number of species N . The three curves represent the case of only pairwise, three-species and four-species interactions, respectively. (B) Regions of stability for ecosystems with N = 5, 8 and 18 species in the (γ, α) space (assuming β = 0). (C) Temporal evolution of the abundances of five different species as given by the Grilli et al. [START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF] model for the competition matrix H reported in the five node graph, and when only pairwise interactions are considered. (D) Same as in the previous panel, but with sampling three seedlings at a time instead of two. Figures adapted from Ref. [START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF] and Ref. [START_REF] Bairey | High-order species interactions shape ecosystem diversity[END_REF].

fixed number of trees, in which N different species of trees compete for space. As in the case of the model by Bairey et al., the state of the system is described by the vector x(t), i.e. by the proportion x i (t) of trees of each species i at time t, with ∑ i x i (t) = 1 ∀t. The dynamics stems from the fact that at each time step a tree, selected at random (with all the species having the same death rate), dies leaving an empty space in the canopy, which can be filled by a new tree. That is when the competition among seedlings begins. The simplest way to model this mechanism is through a pairwise competition: two species are randomly selected and the winner of the competition will fill the gap. Pairwise competitions are characterized by matrix H whose entry h ij represents the winning probability of species i on species j. In particular, Grilli et al. considers the most general case of a matrix of randomly generated positive numbers between 0 and 1, with h ij + h ji = 1, which represents an extension of previous works [START_REF] Allesina | A competitive network theory of species diversity[END_REF][START_REF] Kerr | Local dispersal promotes biodiversity in a real-life game of rock-paper-scissors[END_REF]. The dynamics of the N species is ruled by the following set of differential equation:

ẋi = -x i + 2x i N j=1 h ij x j = x i N j=1 p ij x j ( 69
)
where the negative terms -x i describes the death process, while the positive term 2x i ∑ j h ij x j gives the probability of selecting two seedlings of species i and j, with i winning the competition. Notice that the competition process can be seen as a game [START_REF] Hofbauer | Evolutionary game dynamics[END_REF][START_REF] Martin | Evolutionary dynamics of biological games[END_REF], and the right hand side of the equation can be rewritten in the form of a replicator equation for a zero-sum, symmetric matrix game with two players, where the payoffs p ij are the entries of the skew-symmetric payoff matrix P = H -H T [START_REF] Peter | Evolutionary stable strategies and game dynamics[END_REF][START_REF] Hofbauer | A note on evolutionary stable strategies and game dynamics[END_REF], similar to the payoff matrix introduced in Eq. in Sec. VIII. Independently from the initial conditions x * (0), after an initial transient, Eq. (69) drives the system to a state where some of the N species go extinct, while the remaining ones cycle around a unique equilibrium point x * . This is shown for a case with N = 5 and a particular random choice of matrix H in Fig. 45C. By changing H the model can lead to arbitrarily many species coexisting, and can generate any possible species-abundance distribution empirically observed. However, the neutral cycling around the equilibrium is problematic, as such cycles are not observed in nature. In addition to this, the main issue with the model is that the equilibrium is highly unrobust: any deviation from perfectly identical death rates destabilizes the dynamics and leads to just one species surviving. Grilli et al. have shown that the problem can be solved by going beyond the pairwise interactions and considering the simultaneous competition among more than two species when a new empty space appears in the canopy. They propose an extension of the model in Eq. ( 69) where three seedlings are picked at random, the first competes with the second and the winner with the third. The equations now read:

ẋi = -x i + x i N j=1 N k=1 (2h ij h ik + h ij h jk + h ik h kj ) x j x k = x i N j=1 N k=1 p ijk x j x k (70)
where h ij h ik is the probability that i beats both j and k, h ij h jk is the probability that first j beats k, and then i beats j, and h ik h kj is the probability that k beats j, and then i beats k. Also in this case the equations can be rewritten in the form of a replicator dynamics for a three-player game with a three-dimensional payoff tensor P whose entry p ijk = 2h ij h ik -h ji h jk -h ki h kj gives the payoff of the first player 1 playing strategy i when player 2 plays j and player 3 plays k. Surprisingly, the evolution of this new model leads to globally stable fixed points instead of cycles. As shown in Fig. 45D for the same matrix H as in Fig. 45C, the system converges to a fixed point characterized by the same vector x * that was the center of the oscillation in the model with only pairwise interactions.

In addition to this, the fixed point is now globally stable. Hence, sampling three seedlings at a time instead of two produces stability in a system of competitors. The same authors have also proven that the inclusion of fourth-or higher-order terms does not change the equilibrium but simply accelerates the convergence to it. Moreover, when transforming this deterministic. model into a stochastic one, the presence of higher-order interactions delays the extinction time, allowing a prolonged coexistence of species. Summing up, the model in Eq. ( 70) clearly indicates that the inclusion of higher-order interactions in competitive networks stabilizes dynamics, making species coexistence robust to perturbations.

Mayfield et al. [START_REF] Margaret | Higher-order interactions capture unexplained complexity in diverse communities[END_REF] have pointed out the role of high-order interactions to another important aspect, that of estimating the values of fitness in ecological models. They have shown that it is quite difficult to explain the empirically observed fitness outcomes by considering only pairwise interactions. The inclusion of higher-order interactions, defined as changes to the interactions between two species mediated through a third species, can instead improve the ability to perform such an estimation.

Very recently, Valverde et al [START_REF] Valverde | Coexistence of nestedness and modularity in host-pathogen infection networks[END_REF] have applied a HOrS framework to the analysis of environmentally mediated hostpathogen infections. The hyperlinks of a hypergraph are used to depict three-way associations between plants (hosts), viruses (pathogens), and different habitats. Projecting this information, it is possible to study the interactions between viruses and different host ecotypes, explicitly including the spatial context in which host-pathogen interactions take place. By building a neutral model for the evolution of hostpathogen networks across multiple habitats, the study showed that real ecosystems live in a continuum between nested and modular networks, going beyond the traditional dichotomy between modularity and nestedness in ecological networks [START_REF] Manuel | Nestedness in complex networks: Observation, emergence, and implications[END_REF]. The model has been empirically validated by the analysis of different ecosystems in an agricultural landscape in Spain.

For a more complete review of the current research on the effects of non pairwise interactions on the mechanisms to maintain biodiversity in ecological systems we refer the reader to the review "Beyond pairwise mechanisms of species coexistence in complex communities" by Levine et al. [START_REF] Levine | Beyond pairwise mechanisms of species coexistence in complex communities[END_REF].

D. Other biological systems

Over the last decades network science has become an established framework to describe and understand interactions between biological agents, including proteins, metabolites and genes [START_REF] Zoltán | Life's complexity pyramid[END_REF][START_REF] Aittokallio | Graph-based methods for analysing networks in cell biology[END_REF][START_REF] Vermeulen | The exposome and health: Where chemistry meets biology[END_REF]. Yet, the complexity of biological processes can only rarely be decomposed as a sum of pairwise interactions. For instance, metabolic reactions often involve multiple partners, and proteins typically interact with each other in small groups known as complexes. As a consequence, traditional pairwise approaches, which neglect the presence of higher-order structures, are at risk of oversimplify the complexity of biological systems.

Among the first higher-order analyses in biology were studies showing that the hypergraphs corresponding to mammalian protein complexes [START_REF] Ruepp | CORUM: The comprehensive resource of mammalian protein complexes-2009[END_REF] had a scale-free distributions of both node degrees and hyperedge sizes [START_REF] Wong | An evolutionary and structural characterization of mammalian protein complex organization[END_REF]. The full potential of using HOrS frameworks, in particular hypergraphs, to characterize complex biological processes taking place in biomolecular systems, was already clear more than ten years ago [START_REF] Klamt | Hypergraphs and cellular networks[END_REF]. An important range of applications is that of signaling pathways in cell biology, where group of molecules have to work together to efficiently control cell functions, such as death or division [START_REF] Ritz | Signaling hypergraphs[END_REF]. Different representations of signaling pathways are summarized in Fig. 46. Gaudelet et al. [START_REF] Gaudelet | Higher-order molecular organization as a source of biological function[END_REF] have investigated protein interaction hypergraphs by extending the concept of graphlets [START_REF] Pržulj | Modeling interactome: scale-free or geometric?[END_REF], to the case of higher-order networks. Hypergraphlets were defined as small induced sub-hypergraphs of a given large hypergraph, and an orbit identifies each different set of automorphic nodes. An example of all the hypergraphlets of 1, 2 and 3 nodes is illustrated in Fig. 47. Similarly to motifs [START_REF] Alon | Network motifs: Theory and experimental approaches[END_REF], hypergraphlets allow to characterize wiring patterns of higher-order networks at the local scale. By focusing on the case of yeast and human pathways, the authors showed that modeling protein interactions as hypergraphs allows for better functional predictions than a description in terms of graphs with pairwise interaction only.

Franzese et al. [START_REF] Franzese | Hypergraph-based connectivity measures for signaling pathway topologies[END_REF] have challenged the current approaches to molecular connectivity, which they found either too permissive or too restrictive. As an alternative, they have proposed an intermediate optimal solution that interpolates between graph and hypergraph approaches and allows to better capture the importance of small molecules involved in many distinct reactions. More recently, Klimm et al. [START_REF] Klimm | Hypergraphs for predicting essential genes using multiprotein complex data[END_REF] have used hypergraphs to investigate multiprotein complex data, showing how a pairwise (network) projection produces a hierarchical structure, that is instead not observed when polyadic interactions are considered. After comparing the protein complexes with appropriate null models, the authors found that larger complexes tend to be more essential, with a hyperdegree that better correlates with gene-essentiality information than the standard graph degree. All these results suggest the importance of considering the inherent higher-order structure of protein complexes to reveal complementary information.

Redundancy is an important property of biological systems that guarantees their functionality in the case of misfunctioning of some local components. Pearcy et al. [START_REF] Pearcy | Complexity and robustness in hypernetwork models of metabolism[END_REF] have used hypergraph percolation to assess the robustness of empirical bacterial metabolic higher-order system to random failures. In particular, they have used site percolation, in which a hyperedge (describing a reaction) is activated only when all metabolites involved in the hyperedge are active. Results showed that interacting systems that have evolved in environments with a higher degree of variability are more robust, and that, similarly to their simple network counterparts, also metabolic hypergraphs are characterized by the presence of a core-periphery structure. In another study, metabolic networks have been characterized by the spectrum of a symmetric tensor associated to their hypergraph connectivity, successfully capturing the chemical information of enzymes and structural changes of compounds to define novel classes of functional reactions [START_REF] Shen | A genome-scale metabolic network alignment method within a hypergraph-based framework using a rotational tensor-vector product[END_REF]. Other higher-order topological operators such as combinatorial Laplacians (see Section III E 2) were shown to provide a more complete characterization of chemical reaction networks [START_REF] Jost | Hypergraph Laplace operators for chemical reaction networks[END_REF].

The complexity of biological systems entails that the data we obtain from experiments are often incomplete or characterized by a limited accuracy. For this reason, various works have concentrated on the problem of reconstructing the hypergraphs associated to different kinds of cellular processes where higher-order interactions are at play [START_REF] Tian | A hypergraph-based learning algorithm for classifying gene expression and arrayCGH data with prior knowledge[END_REF][START_REF] Battle | Automated identification of pathways from quantitative genetic interaction data[END_REF][START_REF] Sumazin | An extensive microRNA-mediated network of RNA-RNA interactions regulates established oncogenic pathways in glioblastoma[END_REF][START_REF] Rahman | Reverse engineering molecular hypergraphs[END_REF]. Recently, higher-order inference frameworks have also been extended to deal with dynamic correlations of abundance levels of genes, transcripts and metabolites changing over time. The results provide a better picture of the global dynamic correlation patterns of the investigated biological systems [START_REF] Kong | A hypergraph-based method for large-scale dynamic correlation study at the transcriptomic scale[END_REF].

Higher-order interactions have also revealed key when designing effective drug combinations to prevent or contrast diseases. Indeed, in multiple cases, from cancer to tuberculosis, the combined action of the ingredients of a so-called drug cocktail, even when administered at a low dose, has been shown to be more beneficial than that of single drugs in isolation. Recently, the dose model has been developed as an efficient tool to discover effective drug combinations based on pairwise interactions [START_REF] Zimmer | Prediction of multidimensional drug dose responses based on measurements of drug pairs[END_REF]. While the dose model was originally tested only on triplets and quadruplets of antibiotics, as well as triplets of cancer drugs, very recently the model was shown to successfully predict effective combinations of up to ten drugs used for E. coli and the M. tuberculosis pathogen [START_REF] Katzir | Prediction of ultra-high-order antibiotic combinations based on pairwise interactions[END_REF]. However, when noise in the dataset is more important, prediction of higher-order interactions based on pairs of drugs is less efficient [START_REF] Tendler | Noise-precision tradeoff in predicting combinations of mutations and drugs[END_REF]. Notice that alternative approaches to detect effective drug cocktails are available, such as the so-called pairs model, which was shown to be more noise-resistant but less precise [START_REF] Zimmer | Prediction of drug cocktail effects when the number of measurements is limited[END_REF].

Related to both robustness and drug resistance, the feedbacks between the different levels of genetic information shape to a large degree the link between genotype and phenotype [START_REF] Otwinowski | Inferring fitness landscapes by regression produces biased estimates of epistasis[END_REF][START_REF] Crona | Inferring genetic interactions from comparative fitness data[END_REF]. A relevant example is that of epistasis, which Weinreich et al. [START_REF] Daniel M Weinreich | Should evolutionary geneticists worry about higher-order epistasis?[END_REF] have defined as "the surprise at the phenotype when mutations are combined, given the constituent mutations individual effects". In other words, epistasis describes the somewhat surprising observation that the effects of multiple individual mutations appear to interact with each other in ways that cannot be quantitatively reduced to sums of pairwise interactions [START_REF] Sanchez-Gorostiaga | High-order interactions dominate the functional landscape of microbial consortia[END_REF]. While the concept of higher order epistasis is not new [START_REF] Trudy | Why epistasis is important for tackling complex human disease genetics[END_REF], only recently it has become possible to start a quantitative analysis of its effects in different contexts [START_REF] Sanchez | Defining higher-order interactions in synthetic ecology: Lessons from physics and quantitative genetics[END_REF]. For example, Guerrero et al. [START_REF] Rafael F Guerrero | Proteostasis environment shapes higher-order epistasis operating on antibiotic resistance[END_REF] have investigated how protein quality control machinery influenced the epistasis in traits related to bacterial antibiotic resistance, separating the mutations affecting an essential bacterial enzyme from species-specific effects. Yitbarek et al. [START_REF] Yitbarek | Deconstructing higher-order interactions in the microbiota: A theoretical examination[END_REF] have explored higher-order interactions among gut taxa and their effects on host infection risk, using a theoretical model tailored to the type of data that might be empirically collected in the near future. Mickalide and Kuehn [START_REF] Mickalide | Higher-order interaction between species inhibits bacterial invasion of a phototrophpredator microbial community[END_REF] have studied a controlled microbial trophic chain and detected an increased invasion resistance of the community, stemming not from resource allocation but from high-order interactions between its species.

Finally, dynamical processes have been recently used to extract information on the structure of higher-order biological networks. For instance, Niu et al. [START_REF] Niu | RWHMDA: Random walk on hypergraph for microbe-disease association prediction[END_REF] have considered a microbe-disease hypergraph, where nodes are microbes and diseases are hyperedges. A higher-order random walk (see Section V B) was shown to have a greater accuracy in the prediction of disease-microbe associations compared to that of traditional random walks.

X. OUTLOOK AND CONCLUSIONS

In this review, we have discussed ways and methods to detect, represent, measure and model systems with higherorder interactions, and we have illustrated models of higher-order systems substantially differ both structurally and dynamically from traditional pairwise models.

We have seen time and time again that there are crucial conceptual differences between modeling pairwise and higher-order interactions. For example, we have seen that higher-order interactions typically lead to new sources of non-linearity in the systems under study, which are not present in standard network approaches. Further, considering objects richer than links opens up new possibilities and questions: for example, state variables can now be defined not only on nodes, as in standard practices, but also on edges, triangles, tetrahedra and so on, paving the way to concepts like group states, but also necessitating a consideration about their meaning and interpretation [START_REF] Ana P Millán | Synchronization in network geometries with finite spectral dimension[END_REF]. Much of this new landscape is yet unexplored, but we can already make a few important observations. At the dynamical level, it is evident that the presence or absence of higher-order interactions is especially important.

We reviewed explicit examples in which higher-order interactions profoundly change the critical behavior of dynamical processes in both simplicial complexes [START_REF] Muhammad | Control using higher order Laplacians in network topologies[END_REF][START_REF] Michael T Schaub | Random walks on simplicial complexes and the normalized Hodge Laplacian[END_REF][START_REF] Iacopini | Simplicial models of social contagion[END_REF][START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF][START_REF] Per | Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching[END_REF][START_REF] Bick | Chaos in generically coupled phase oscillator networks with nonpairwise interactions[END_REF] and hypergraphs [START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF][START_REF] Ferraz De Arruda | Social contagion models on hypergraphs[END_REF][START_REF] Matthew H Matheny | Exotic states in a simple network of nanoelectromechanical oscillators[END_REF][START_REF] Alvarez-Rodriguez | Evolutionary dynamics of higher-order interactions[END_REF]. However, even when a dynamical process does not explicitly contain higher-order dynamical terms, it is possible to find new effects due to higher-order terms in the structural patterns underlying the dynamics. For example, simple contagion processes are usually considered to be largely oblivious to higher-order structures (e.g. large groups, heterogeneous and/or hierarchical clique structure) beyond clustering in the underlying contact patterns. However, St-Onge et al. [START_REF] St-Onge | School closures, event cancellations, and the mesoscopic localization of epidemics in networks with higher-order structure[END_REF] recently showed that membership of nodes to cliques of heterogeneous sizes can result in unexpected mesoscopic localization phenomena, in turn yielding possible outbreak persistence for cases in which standard diffusion models would predict outbreak extinction. Along similar lines, Petri and Barrat [START_REF] Petri | Simplicial activity driven model[END_REF] showed that including group activations in a simple contagion model on a temporally evolving contact substrate can shift the critical infectivity, and that the shift depends on a trade-off between the distributions of group sizes and of activity of the nodes. The importance of higher-order interactions is naturally not limited to their effects on dynamics. Recent examples include applications in which higher-order terms allowed better descriptions of group formation in scientific collaborations [START_REF] Patania | The shape of collaborations[END_REF][START_REF] Salnikov | Simplicial complexes and complex systems[END_REF][START_REF] Milojević | Principles of scientific research team formation and evolution[END_REF] and finer classification of the local environment of node [START_REF] Alexander P Kartun-Giles | Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks[END_REF]. In other cases, they improved the predictions of new interactions beyond the capacity of link-based prediction models, and also significantly denoised signals in complex environments [START_REF] Michael | Flow smoothing and denoising: Graph signal processing in the edge-space[END_REF][START_REF] Pokorny | Topological trajectory classification with filtrations of simplicial complexes and persistent homology[END_REF]. Topological descriptions have even been proposed as a convenient tool to model epistemic models with distributed computing tasks [START_REF] Goubault | A simplicial complex model for dynamic epistemic logic to study distributed task computability[END_REF][START_REF] Hans Van Ditmarsch | Knowledge and simplicial complexes[END_REF].

The study of higher-order systems, of their characteristic properties and their effects on dynamics is a recent field, and there are still many open and unexplored directions. Below, we list some of them:

Measures for higher-order structures. We have described the most common measures used in the description of HOrSs. With the exception of the intrinsically algebraic ones, most of these measures however are straightforward generalizations of those used for networks. Temporal, multiplex and multilayer measures are still lacking, and generally there is a large space to be filled. An example are measures that simply cannot be defined in pairwise networks, the simplicial closure being one of these [START_REF] Patania | The shape of collaborations[END_REF][START_REF] Alexander P Kartun-Giles | Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks[END_REF][START_REF] Austin R Benson | Simplicial closure and higher-order link prediction[END_REF]. Other examples touch on state variables defined on simplices or hyperedges of arbitrary dimensions: while we have a clear understanding of what synchronization among nodes looks like in models of oscillators, it is much harder to have an intuitive grasp of what the state of an edge, or of a triangle, might mean [START_REF] Reitz | The higher-order spectrum of simplicial complexes: A renormalization group approach[END_REF]. Defining measures able to capture these quantities would also be a step toward an understanding of their role and quantitative insights about their effects. A further example is homological information obtained from topological data analysis techniques: it is defined as an equivalence class and therein lies its power and curse, because its resulting non-local nature makes it a powerful descriptive tool, but also very hard to localize on specific elements of the HOrS. Efforts to find a solution to this issue already exist [START_REF] Petri | Homological scaffolds of brain functional networks[END_REF][START_REF] Kališnik | A higher-dimensional homologically persistent skeleton[END_REF][START_REF] Guerra | Homological scaffold via minimal homology bases[END_REF], but in many cases the problem is ill-defined and the solution specific to the problem at hand. So, are there standard or, at least, acceptable ways to localize homological features as to use them in further analysis? Or should we give up on localizing shapes, and think only about manifolds? Finally, while hypergraph partitioning [START_REF] Li | Submodular hypergraphs: P-Laplacians, Cheeger inequalities and spectral clustering[END_REF][START_REF] Karypis | Multilevel hypergraph partitioning: Applications in VLSI domain[END_REF] has a long history, little work has focused on characterizing the mesoscopic structure of simplicial complexes, both in terms of the definition and detection of communities (e.g. [START_REF] Charles | Simplex2Vec embeddings for community detection in simplicial complexes[END_REF][START_REF] Neubauer | Towards community detection in k-partite k-uniform hypergraphs[END_REF]) and of other types of (quasi-)local (e.g. rich club, assortative behavior, etc) and spanning structures (e.g. cores [START_REF] Marietti | Cores of simplicial complexes[END_REF], minimal spanning trees [START_REF] Duval | Critical groups of simplicial complexes[END_REF], expander properties [START_REF] Steenbergen | A Cheeger-type inequality on simplicial complexes[END_REF][START_REF] Parzanchevski | Mixing in high-dimensional expanders[END_REF]).

Generative models for higher-order structures. Models able to constrain various features of higher-order structures are crucial because they provide a principled answer to the question of what constitutes a non-trivial and topologically rich HOrS. As we have discussed in this review, there are currently few random models of simplicial complexes. Some of the existing models of simplicial complexes reproduce the local connectivity patterns [START_REF] Young | Construction of and efficient sampling from the simplicial configuration model[END_REF][START_REF] Courtney | Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes[END_REF], but none exist that are able to reproduce or approximate more refined topological structures, like a specific target homology or mesoscopic structures. Finally, exactly like conventional networks, HOrSs can change in time or be composed by different qualitatively different types of interactions. With few notable exceptions [START_REF] Petri | Simplicial activity driven model[END_REF][START_REF] Babichev | Robust spatial memory maps encoded by networks with transient connections[END_REF], to date there are practically no models taking into account the temporal or multiplex structure of higher-order interactions-the vast majority model growth instead [START_REF] Wu | Emergent complex network geometry[END_REF].

Understanding the driving mechanisms of higher-order dynamics. Developing new measures and generative models is also important to identify the fundamental mechanisms that lie behind the patterns we observe. There is in fact clear evidence that non-trivial higher-order topologies emerge in social [START_REF] Sizemore | Classification of weighted networks through mesoscale homological features[END_REF][START_REF] Petri | Topological strata of weighted complex networks[END_REF] as well as in biological systems [START_REF] Petri | Homological scaffolds of brain functional networks[END_REF][START_REF] Giusti | Clique topology reveals intrinsic geometric structure in neural correlations[END_REF][START_REF] Dabaghian | A topological paradigm for hippocampal spatial map formation using persistent homology[END_REF], but very little understanding of how or why they do emerge. Currently, only few models focus on describing coordination, group interactions and in general growth of HOrSs at the group level, and none reproduce higher-order topological invariants. This is in part due to the predominance of network descriptions up until now, and in part to the actual difficulties to provide an analytical description that one encounters as soon as higher-order terms are introduced. generalizing well-known dynamical systems. In addition to the work on contagion mentioned above, early efforts in this direction are already under way [START_REF] Kuehn | A universal route to explosive phenomena[END_REF], including generalization of Kuramoto models to higher-order interactions [START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF][START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF][START_REF] Per | Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching[END_REF] and games [START_REF] Alvarez-Rodriguez | Evolutionary dynamics of higher-order interactions[END_REF]. A particularly important and recent line of research focuses on extending concepts from percolation to simplicial complexes, dubbed topological percolation, both in simplicial [START_REF] Bianconi | Topological percolation on hyperbolic simplicial complexes[END_REF][START_REF] Bianconi | Percolation on branching simplicial and cell complexes and its relation to interdependent percolation[END_REF] and homological terms [START_REF] Bobrowski | Homological percolation and the Euler characteristic[END_REF]. Overall, however, we still lack a general understanding of how higher-order terms affect dynamical systems.

Inference from data. What is a truly genuine higher-order interaction? And how do we tease it apart from low-order ones in data? And if it is possible, what type of data do we need to tell the difference between low and higher-order interactions? These are hard questions in general, but for some systems it is easier to approach them with some confidence. Indeed, for systems where the data already comes in the form of sets, it is straightforward to extract higher-order interactions and measure their strengths. This is the case, for instance, of affiliation networks such as coauthorship data, where each paper constitutes an interaction among all authors, or of data about joint presence in locations, or different ingredients in recipes. In many systems, however, interactions are not already identified, but instead need to be inferred from the data. The most obvious example is that of timeseries: brain functional networks are usually estimated by computing correlations, or other measures based on information theory, between fMRI or EEG timeseries [START_REF] Phinyomark | Resting-state fmri functional connectivity: Big data preprocessing pipelines and topological data analysis[END_REF]; similarly, financial networks are built starting from stock option prices or timecourse of revenues, and so on [START_REF] Battiston | The structure of financial networks[END_REF]. In all these cases, higher-order interactions are seldom considered relevant, or even computed, due to various reasons. First, many-body correlations are often computed as second order approximations of standard correlations, and hence considered as perturbations. Second, measures that can find higher-order effects [START_REF] Faes | Estimating the decomposition of predictive information in multivariate systems[END_REF][START_REF] Faes | Multiscale information decomposition: Exact computation for multivariate Gaussian processes[END_REF][START_REF] Fernando E Rosas | Quantifying high-order interdependencies via multivariate extensions of the mutual information[END_REF] often require long timeseries, which in many cases are not available. Third, the scarce availability of rich data on dynamical models with and without higher-order interactions makes it impossible to define a proper inference scheme for the presence, nature and strength of higher-order interactions. This last point is crucial and links back to the importance of models to understand the underlying mechanisms. Just like it is hardly possible to distinguish complex from simple contagion from prevalence and incidence data [START_REF] Hébert-Dufresne | Macroscopic patterns of interacting contagions are indistinguishable from social reinforcement[END_REF], it might well be the case that it is not possible to tease apart the effects of complex contagion from those of simplicial contagion [START_REF] Iacopini | Simplicial models of social contagion[END_REF] in absence of microscopic mechanistic information. However, currently there are no inference schemes, akin to Peixoto [START_REF] Tiago | Network reconstruction and community detection from dynamics[END_REF], able to test hypothesis about higher-order interactions and provide guidance in these situations. Developing such schemes is therefore paramount to the advancement of the field.

The open directions discussed above focus on theoretical, modeling and methodological issues. HOrSs have already been fruitful in a smattering of applications, but they still need to find concrete applications to a wider range of topics. Indeed, the real test of their relevance will be in the breadth and depth of their impact on specific problems. While the paradigm of higher-order interactions is general, we envision that problems in biology, ecology, population dynamics, neuroscience and computational social sciences will be the first and the foremost to benefit from these new tools and ideas. We hope that this review will provide a guiding path for researchers interested in HOrSs, and we look forward to seeing how HOrSs themselves will reshape the landscape of complex systems research.

DATA

  about interactions: [a,b,c],[a,d],[d,c],[c,e

FIG. 3 .

 3 FIG.3. Matricial and tensorial descriptions of HOrSs: Visualization of incidence matrices and adjacency matrices that can be used to represent the structure of HOrSs. There are three types of matrices: (A-D) incidence matrices relating nodes and edges, (E-H) adjacency matrices representing the connectivity of edges to edges via the nodes they share in common, and (I-L) adjacency matrices relating nodes to nodes via edges. Furthermore, one can consider edges aggregated by dimensions (left panels) or only subsets of edges of the same dimension, obtaining a collection of matrices, one for each of the different sizes of hyperedges present in the HOrS (right panels).

FIG. 4 .

 4 FIG. 4.Example of k-walks on hyperedges. The simplest walk, a 1-walk, is the one where hyperedges share only one vertex (A) similarly to how walks are defined on graphs. Such walks can be generalised to larger intersections (k-walks), for example 2-walks (B and C). Note that the size of the intersection poses no upper bound on the size of hyperedges along the walk, for example B and C and composed hyperedges of different size while still being 2-walks. Figures adapted from Ref.[START_REF] Lu | High-ordered random walks and generalized Laplacians on hypergraphs[END_REF].

FIG. 5 .

 5 FIG.5. Walks in HOrSs. Visualization of the different definitions of walks on an toy example of higher-order network. From left to right, the definition of the walk gets more restrictive. For each restriction on the defining variable of a walk (what elements are allowed to be considered for a walk and how much do they need to overlap in order to be adjacent)-we color what parts of the HOrS are reachable by at least a walk of length greater than one, and in gray what parts do not allow any walk to pass through them. In (C,D), some parts of the HOrS are connected only if the HOrS is a simplicial complex, and we visualize those with a striped pattern. We can see how the less restrictive walk (A), which can pass through two edges that have at least one vertex in common, yields the same connectivity as its underlying graph. Restricting the intersection between two adjacent edges to have at least 2 vertices in common, example (B), already highlights different mesoscale connectivity patterns in the HOrS, which can be further studied introducing a further restriction on the size of the edges, examples (C) and (D).

FIG. 8 .

 8 FIG.8. Example of HOrSs generated by the model of Gleeson and Melnik[START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF]. In this model a fraction g k of nodes of degree k of a configuration model network[START_REF] Mark | Random graphs with arbitrary degree distributions and their applications[END_REF] are replaced by cliques. Figure reproduced from Ref.[START_REF] James P Gleeson | Analytical results for bond percolation and k-core sizes on clustered networks[END_REF].

FIG. 9 .

 9 FIG.9. Constructing random HOrSs by projecting a bipartite network of interactions[START_REF] Newman | Mixing patterns in networks[END_REF]. (A) Realization of the bipartite configuration model, (B) projected as a network, where (C) some edges are removed. The construction shown in panels (A) and (B) is also known as a random intersection graph[START_REF] Micha L Karoński | On random intersection graphs: The subgraph problem[END_REF]. Figures adapted from Ref.[START_REF] Newman | Mixing patterns in networks[END_REF].

2 FIG. 10 .

 210 FIG.10. Latent space hypergraphical model[START_REF] Turnbull | Latent space representations of hypergraphs[END_REF]. (A,B) Nodes embedded in R 2 , with radii of length r1 and r2 > r1 drawn around them. (C) Hypergraph obtained by connecting sets of nodes mutually at a distance of dij < 2r1 and dij < 2r2. Notice the multiple radii allows the model to create the hyperedge {c, e, f }, {c, e} and {e, f }. A model with only one radius wouldn't be able to omit {c, f }. Figures adapted from Ref.[START_REF] Turnbull | Latent space representations of hypergraphs[END_REF].

FIG. 11 .

 11 FIG. 11. Difference between (A) Čech and (B) Vietoris-Rips complexes. Figures adapted from Ref. [265].

FIG. 12 .

 12 FIG. 12. Boards and directors moving about a latent space. Board are represented as large colored dots, going from 2003 in yellow to 2013 in red. Directors are shown as small blue dots. Edges are not shown. Figure reproduced from Ref. [279].

FIG. 13 .

 13 FIG. 13. Different growing geometrical networks produced by the simple model of Wu et al. Parameter m controls the maximal number of triangle per edges, and p controls closure. Figure reproduced from Ref. [282].

FIG. 14 .

 14 FIG.14. Laplacian spectrum and return-probability in higher-order diffusion according to Torres and Bianconi[START_REF] Joaquín | Simplicial complexes: Higher-order spectral dimension and dynamics[END_REF]. (A) Cumulative density of the eigenvalues of the combinatorial Laplacian of order k, with k = 0, standard Laplacian (blue solid line), k = 1 (red dashed line), k = 2 (yellow dotted line) and k = 3 (purple dot-dashed line) for a symplicial complex with 2000 nodes generated by means of the NGF model with d = 3 and flavour s = -1 (see Sec. IV B 4). (B) Return-probability for the same system. Figures adapted from Ref. [319].

FIG. 15 .

 15 FIG. 15. Semi-supervised learning: vertex and edge perspective. (A) In the standard graph-based semi-supervised learning, the structure of data points is encoded in a similarity graph, where each node is a data sample and the edges represent the similarity between pairs of nodes. (B) In the semi-supervised learning for edge-flows proposed in Ref. [322] data points are instead assigned and inferred on the edges of a graph. Figures reproduced from Ref. [322].

FIG. 16 .

 16 FIG. 16. Classification methods based on random walks on hypergraph. The performance of both Zhou et al. [84] and Carletti et al. [325] models of random walk on hypergraphs is tested on a classification task performed on a zoo dataset. Reported are the embeddings of the nodes of the hypergraph in a Euclidean space built from the Laplacian eigenvectors. Different symbol colors and shapes represent different animal classes. (A,B) Results obtained with eigenvectors corresponding to the 2nd and 3rd smallest eigenvalues, and the 3rd and 4th smallest eigenvalues respectively, in the model by Zhou at al. (C) Embedding based the eigenvectors corresponding to the three smallest eigenvalues in the model by Carletti et al. Figures adapted from Ref.[START_REF] Zhou | Learning with hypergraphs: Clustering, classification, and embedding[END_REF] and Ref.[START_REF] Carletti | Random walks on hypergraphs[END_REF].

FIG. 17 .

 17 FIG. 17. Example of random walk on hypergraphs. (A) An hypergraph with m = 7 hyperedges of size k = 2 and one hyperedge of size k = 6, and (B) its corresponding projected network. (C) Probability of finding the walker on node h (circles) and c (squares) for a random walk on the hypergraph (red) and on the projected network (green), and for different size m of the hub. Figure reproduced from Ref. [325].

FIG. 19 .

 19 FIG.[START_REF] Atkin | Mathematical Structure in Human Affairs[END_REF]. Abrupt desynchronization induced by higher-order interactions in the model in Eq.[START_REF] Lancichinetti | Benchmark graphs for testing community detection algorithms[END_REF]. The two order parameters R1 and R2 are shown as a function of the three-body coupling strength K2, in (A) and (B) respectively. The system exhibits multistability, and each stable branch represents a two-cluster state with a proportion of η oscillators in the first cluster. Figures adapted from Ref.[START_REF] Per | Abrupt desynchronization and extensive multistability in globally coupled oscillator simplexes[END_REF].

FIG. 20 .

 20 FIG. 20. Phase diagrams of the model with higher-order interactions in Eq. (45). (A) Case K1 = 0 when only three-body interactions are present. (B) General case with both two-and three-body interactions. Vertical black lines represent the interval [0, 1] of values the order parameter R1 can take. On these lines, black circles and boxes represent the value of R1 for all coexisting stable states. Figures adapted from Ref. [373].

FIG. 21 .

 21 FIG. 21. Phase diagrams of the simplicial complex oscillator model of Ref. [376]. (A) Higher-order interactions induce abrupt transitions between incoherence and synchronization. (B) Moreover, higher-order interactions can stabilise the synchronized state, even when pairwise (1-simplex) interactions are repulsive (K1 < 0). (C) Two-parameter bifurcation diagram identifying the region of bistability. Analytical predictions (solid curves) are in agreement with the numerical simulations (open circles). Figures adapted from Ref. [376].

FIG. 24 .

 24 FIG.[START_REF] Lambiotte | From networks to optimal higher-order models of complex systems[END_REF]. Switching dynamics in the Bick model of Ref.[START_REF] Bick | Heteroclinic switching between chimeras[END_REF] with three populations of two oscillators each. The oscillators in the three populations intermittently synchronize and desynchronize. Figure reproduced from Ref.[START_REF] Bick | Heteroclinic switching between chimeras[END_REF].

FIG. 26 .

 26 FIG. 26. Coupling functions affect synchronization in simplicial complexes of coupled chaotic oscillators as in the framework of Ref. [405]. Synchronization phase diagram of a system of four Rössler systems are coupled in pairs and triplets according to the simplicial complex sketched. A baseline case (A) is compared to (B) where the pairwise coupling function is changed, and (C) where the triplet coupling function is changed. The predictions of the Master Stability Function formalism (blue lines) are in good agreement with the regions of synchronization obtained by numerical simulations (black). Figures adapted from Ref. [405].

FIG. 28 .

 28 FIG.[START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF]. Inference of directed pair and triplet couplings among three Van der Pol oscillators from the method in Ref.[START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF]. An arrow from the center to a node i indicates a directed triplet interaction from (j, k) to i. Panels (A) and (B) show two examples of the original structural network and the reconstructed one. While the inference in the first case is good, the method yields a spurious links from node c to a. Figures adapted from Ref.[START_REF] Kralemann | Reconstructing phase dynamics of oscillator networks[END_REF].

FIG. 29 .

 29 FIG.[START_REF] José | Ecological networks and their fragility[END_REF]. Simplicial contagion model (D = 2)[START_REF] Iacopini | Simplicial models of social contagion[END_REF]. (A-F) Different channels of infection for a susceptible node i are shown. Notice (F), where node i can get the infection from each of the two 1-simplices with probability β, and also from the 2-simplex with probability β ∆ . Behavior on synthetic random simplicial complexes: In (H) the average fraction of infected obtained by means of numerical simulations is plotted against the rescaled infectivity λ = β⟨k⟩ µ for different values of λ ∆ (λ ∆ = 0 gives results for the standard SIS model without higher-order effects). The red lines correspond to the analytical MF solution described by Eq. (58). When λ ∆ (λ ∆ = 2.5 we observe a discontinuous transition with the formation of a bi-stable region where healthy and endemic states co-exist. (I) Temporal evolution of the densities of infectious nodes in the bi-stable region (λ = 0.75, λ ∆ = 2.5). Different curvesand different colorscorrespond to different values of ρ0, the initial density of infectious nodes. The dashed horizontal line corresponds to the unstable branch of the MF solution, separating the two basins of attraction. Figures adapted from Ref.[START_REF] Iacopini | Simplicial models of social contagion[END_REF].

FIG. 32 .

 32 FIG.[START_REF] Gao | Networks formed from interdependent networks[END_REF]. Voter dynamics on different structured populations. (A) Node-update rule on a lattice and (B) on a network: a randomly selected node copies the opinion of a randomly selected neighbor. (C) Link-update rule on a network: one of the two nodes of a randomly selected edge adapts its opinion to the one of the other. (D) Hyperlink-update rule on a hypergraph/simplicial complex: the nodes of a randomly selected simplex incident on a randomly selected edge adapt their opinion to the one of the majority.

FIG. 33 .

 33 FIG. 33. Average node state for the 3-body non-linear consensus dynamics with continuous-valued opinions on a fully-connected hypergraph. At t = 0 an asymmetric opinion initialization is considered, such that x(0) = 0.2. The interaction function iss(x) = exp(λx). Dotted red lines indicate the initial value of the average node state. Black and grey solid lines represent the evolution of the state of nodes in the two initial configurations, one and zero respectively. Dashed blue lines denote the approximated final state. (A) If λ < 0 (similar node states reinforcing each other) the asymptotic average opinion state drifts towards the majority opinion. (C) The opposite effect is observed for λ > 0, where the dynamics shows a drift towards balance. (B) When λ = 0 the linear dynamics with a conserved average state is recovered. Figures adapted from Ref. [318].

FIG. 34 .

 34 FIG.[START_REF] Bullmore | Complex brain networks: Graph theoretical analysis of structural and functional systems[END_REF]. Traditional graph implementation of a multiplayer game. At each elementary step a player i and one of its neighbors j are chosen at random. Each individual accumulates earnings by playing all games in which it is involved, namely the game in which it is the focal individual of the group, and the k games where it participates in a group centered on one of its neighbors. All groups in which i and j participate are listed in panels (A) and (C), for a simple two-dimensional lattice (B). Finally, i compares its payoff to that of j, updating its strategy by imitating the strategy of the neighbor with a probability which depends on the relative difference of the payoff. The presence of links among neighbors of i and j (clustering) does not affect the definition of the groups.

FIG. 35 .

 35 FIG. 35. Public goods game on bipartite graphs. Information on the exact group structure encoded in a bipartite network (A) is lost when its one-mode projection is considered, where two individuals are directly linked if they both participate in at least one group (B) . Cooperation is enhanced when the game is played by considering the real group structure instead of the projected graph, both for the fixed cost per game (C) and fixed cost per individual (D) implementation. Prosocial behavior is greater when fixed costs per individual are considered. Figures (C) and (D) reproduced from Ref. [582].

FIG. 36 .

 36 FIG.[START_REF] John D Medaglia | Cognitive network neuroscience[END_REF]. Hypergraph implementation of strategic group interactions. (A) At each time step, a node i is chosen randomly, and one of the hyperlinks to which it participates is selected. (B) All the members of the hyperlink play a game for each of the hyperlinks they are part of, and (C) accumulate payoffs accordingly.

FIG. 37 .

 37 FIG. 37. Cooperation in the public goods game on hypergraphs. (A) Average fraction of cooperators as a function of the reduced synergy factor r for homogeneous hypergraphs with interactions of different order g. (B) Critical value rc for the emergence of cooperation as a function of the density of the hypergraphs L Lc, where Lc is the critical number of hyperlinks for a connected hypergraphs, for different values of g. Classes of 35 different heterogeneous hypergraphs H with hyperlinks of orders g = {2, 3, 4, 5} are considered. The synergy factor R(α, β) scales according to Eq.(64). Results for two values of the exponent, β = 1 (C) and β = 2 (D), are shown. (E) Dependency of synergy factors from hypergraphs describing co-authored publications in journals of the American Physical Society assuming the collaboration process is optimal. Figures reproduced from Ref. [586].

FIG. 38 .

 38 FIG.[START_REF] Fortunato | Community detection in graphs[END_REF]. Affiliation network of six children and three parties. The interactions are shown respectively as a bipartite network actor-events, as the hypergraph with the six children as the nodes, and as the dual hypergraph with the three parties as the nodes. Figures adapted from Ref.[START_REF] Wasserman | Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)[END_REF] .

FIG. 39 .

 39 FIG. 39.Early simplicial representation of interactions among social science researchers. (A) Simplicial complex showing the pattern of links between social science researchers, P1-P29, through shared linking events, nodes 1-19, indicating participation to events or affiliation to university departments. (B) Table showing the q-analysis of the simplicial complex. The first column is the dimension of components made up of chains of simplices. The second column is the number of chains at each level, while the third column reports the names of the simplices making up each chain. Figure and table reproduced from Ref.[START_REF] Linton | Q-analysis and the structure of friendship networks[END_REF] .

FIG. 40 .

 40 FIG.[START_REF] Karrer | Stochastic blockmodels and community structure in networks[END_REF]. Topology of hyppocampal cells' activations encodes geometrical information about the environment. (A) an example of construction of order complex from a full correlation matrix. At each step the order complex (top row) encodes the topology of the density-filtered correlation graph (bottom row). (B) Betti curves of the pairwise correlation matrix for the activity of N = 88 place cells in hippocampus during open-field spatial exploration. (C) The same Betti curves from B (bold lines) shown overlaid on the mean Betti curves from random geometric complexes (top) and from complexes built from shuffled correlation matrices (bottom). Note the differences in when Betti numbers emerge in the case of random geometric complexes and in the magnitude itself for shuffled weight complexes. Figures adapted from Ref[START_REF] Giusti | Clique topology reveals intrinsic geometric structure in neural correlations[END_REF].

FIG. 42 .

 42 FIG. 42. Persistent homology of structural and functional brain connectivity. (A) Distribution of maximal cliques in the average DSI (black) and individual minimally wired (gray) networks, thresholded at an edge density of ρ = 0.25. Heat maps of node participation shown on the brain surfaces for a range of clique degrees equal to 4-6 (left), 8-10 (middle), and 12-16 (right). (B) Minimal cycles representing each persistent cavity at the density at birth represented in the brain (top) and as a schematic (bottom) (adapted from [636]).. (C) Comparison of persistence p and birth b distributions. Left, H1 generators persistence distributions for the placebo group and psilocybin group. Right, distributions of homology cycles' births. (D) Statistical features of group homological scaffolds. Left, probability distributions for the edge weights in the persistence homological scaffolds (main plot) and the frequency homological scaffolds (inset). Right, scatter plot of the scaffold edge frequency versus total persistence for both placebo and psilocybin scaffolds. (E) Simplified visualization of the persistence homological scaffolds for subjects injected with placebo (left) and with psilocybin (right). Colours represent communities obtained by modularity optimization on the placebo scaffold and display the departure of the psilocybin connectivity structure from the placebo baseline. Figures adapted from Ref. [598].

FIG. 43 .FIG. 44 .

 4344 FIG. 43. Pairwise and high-order interactions in ecological systems. (A) Direct pairwise positive and negative interactions among species. (B) Three-ways interactions: for example species 3 attenuates the direct inhibitory effect of species 1 on species 2. (C) Four-way interactions: species 4 inhibits the inhibition produced by species 3 on the interaction between 1 and 2. Figures adapted from Ref. [655].

c

  ijkl x j x k + . . .

FIG. 45 .

 45 FIG.[START_REF] Guillaume | Bipartite graphs as models of complex networks[END_REF]. Dynamical effects of higher-order interactions in ecological systems. (A) Critical strength of interactions in the Bairey et al.[START_REF] Bairey | High-order species interactions shape ecosystem diversity[END_REF] model in Eq. (67) and (68) beyond which the coexistence of species is lost as a function of the number of species N . The three curves represent the case of only pairwise, three-species and four-species interactions, respectively. (B) Regions of stability for ecosystems with N = 5, 8 and 18 species in the (γ, α) space (assuming β = 0). (C) Temporal evolution of the abundances of five different species as given by the Grilli et al.[START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF] model for the competition matrix H reported in the five node graph, and when only pairwise interactions are considered. (D) Same as in the previous panel, but with sampling three seedlings at a time instead of two. Figures adapted from Ref.[START_REF] Grilli | Higher-order interactions stabilize dynamics in competitive network models[END_REF] and Ref.[START_REF] Bairey | High-order species interactions shape ecosystem diversity[END_REF].

FIG. 46 .

 46 FIG. 46. Different representations of biological signaling pathways. In the simplest representation, a signaling pathway is simply a set of proteins, with no additional information. Networks can only capture pairwise interactions between proteins. Hypergraphs naturally encode multilateral interactions and reactions. Figure reproduced from Ref. [684].

  p 11 p 11 p 11 p 12 p 12 p 11 p 12 p 12 p 11 p 21 p 11 p 22 p 12 p 21 p 12 p 22 p 21 p 11 p 21 p 12 p 22 p 11 p 22 p 12 p 21 p 21 p 21 p 22 p 22 p 21 p 22 p 22

  Critical coupling and motifs. In motifs, i.e. small graphs recurrent in various biological, social and technological networks, the critical coupling strength K1 for synchronization decreases as the number of links increases. Figure adapted from Ref.[START_REF] Vega | Fitness for synchronization of network motifs[END_REF].

	Motif
	# links	4	5	6
	K1	0.22	0.18	0.14
	FIG. 18.

ACKNOWLEDGMENTS F. B. acknowledges partial support from the ERC Synergy Grant 810115 (DYNASNET). G. C. and M. L. acknowledge partial support from the European Cooperation in Science & Technology (COST): Action CA15109. I. I. acknowledges partial support from the Urban Dynamics Lab under the EPSRC Grant No. EP/M023583/1. V. L. acknowledges support from the Leverhulme Trust Research Fellowship "CREATE: the network components of creativity and success", RF-2019-059. J.-G. Y. acknowledges support from the James S. McDonnell Foundation. G. P. acknowledges partial support from Intesa Sanpaolo Innovation Center and from Compagnia San Paolo (ADnD project).

The authors acknowledge valuable and stimulating discussions with many members of the network science community on the topic covered in our report, including Antoine Allard, Unai Alvarez-Rodriguez, Alex Arenas, Tomaso Aste, Paolo Bajardi, Albert-László Barabási, Andrea Baronchelli, Alain Barrat, Danielle Bassett, Demian Battaglia, Jaume Bertranpetit, Ginestra Bianconi, Christian Bick, Jacob C.W. Billings, Stefano Boccaletti, Francesco Bonchi, Guido Caldarelli, Timoteo Carletti, Ciro Cattuto, Mario Chavez, Guilherme Ferraz de Arruda, Fabrizio De Vico Fallani, Tiziana Di Matteo, Tina Eliassi-Rad, Paul Expert, Duccio Fanelli, Michael Farber, Mattia Frasca, Luca Gallo, Lucia Gambuzza, Laetitia Gauvin, Fosca Giannotti, Tommaso Gili, Corrado Gioannini, Jesus Gómez-Gardeñes, Heather A. Harrington, Laurent Hébert-Dufresne, Esther Ibáñez-Marcelo, Gerardo Iñiguez, Cliff Joslyn, Márton Karsai, Sonia Kéfi, János Kertész, Julia Koltai, Dima Krioukov, Lucas Lacasa, Renaud Lambiotte, Bruno Lepri, Michael Lesnick, Daniele Marinazzo, Andrea Migliano, Yamir Moreno, M.E.J. Newman, André Panisson, Daniela Paolotti, Luca Pap-

the following system: θi = ω + K 1

⟨k (1) ⟩ N j=1 a ij sin(θ j -θ i ) + K 2 2!⟨k (2) ⟩ N j,k=1 a ijk sin(θ j + θ k -2θ i ) + K 3 3!⟨k (3) ⟩ N j,k,l=1 a ijkl sin(θ j + θ k + θ l -3θ i ) + ...

+

K qmax q max !⟨k (qmax) ⟩ N j2,...,jq max+1 =1 a ij2...jq max+1 sin qmax+1 m=2 θ jm -q max θ i , [START_REF] Guimerà | Module identification in bipartite and directed networks[END_REF] which is a natural extension of the Kuramoto model with all oscillators having identical frequencies ω, and K q denoting the coupling strength of q-simplex interactions. Here, the complex topology, which is as in Ref. [START_REF] Per | Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching[END_REF] remains mathematically tractable because oscillators have identical frequencies. All cliques in the graph defined by the adjacency tensors A (q) = {a ij2...jq+1 } with q indices: for example, at order q = 2, a ijk = 1 if there is a triplet interaction (i, j, k) and 0 otherwise. Coupling functions at each order are also a natural generalization of the standard pairwise sine function, as they are chosen to be symmetric with respect to oscillator i, meaning that any permutation of the other indices leaves the coupling function invariant. The authors have shown that each term in Eq. ( 48) can be rewritten in terms of a newly defined Laplacian matrix, and all such matrices can combined into a multi-order Laplacian controlling the dynamics of the whole system. The authors denote as k (q) i the connectivity of order q, i.e. the number of distinct q-simplices that node i is part of, and as Â(q) = {â (q) ij } the adjacency matrix of order q, i.e. the number of distinct q-simplices that the pair (i, j) is part of. These definitions recover the usual definitions for q = 1. Note that the adjacency matrices Â(q) are different objects than the adjacency tensors A (q) : the former have dimension 2 and can take any integer value, whereas the latter have dimension q + 1 and only takes binary values. Infinitesimal heterogeneous perturbations δθ i around the synchronized state θ S (t) = ωt, defined as δθ i = θ i -ωt, evolve according to the linearized dynamics. In a system with q-simplex interactions, this dynamics is determined by a Laplacian L (q) = {l (q) ij } of order q defined as:

which is a natural generalization of the usual pairwise Laplacian. For instance, in the case of pure 3-simplex interactions, K q = 0 for all q ≠ 3, the linearized system reads:

The stability of the synchronized state is then measured by the second Lyapunov exponent λ

2 , which is proportional to the second eigenvalue Λ

(3) 2 of the Laplacian L (3) . When interactions of all different orders are present, it is practical to define a multi-order Laplacian L (mul) = {l

. so that the linearized equations read:

and the stability of the synchronized solution can be assessed by simply computing the second Lyapunov exponent λ

, which is proportional to the second eigenvalue Λ (mul) 2

of the multi-order Laplacian L (mul) . The authors have then applied the multi-order Laplacian framework to simplicial complexes of increasing complexity. In the case of all-to-all higher-order interactions, where all possible interactions take place at each order, a full analytical spectrum can be obtained. When only attractive couplings are present, the spectrum indicates (i ) that the higher the order of pure interactions, the more these interactions stabilize synchronization, as shown in Figs. 23A-C, and (ii ) that the more orders are taken into account, the more stable synchronization is, as shown in Fig. 23D. When instead the coupling is attractive at some orders, and repulsive at others, the interplay of the different terms can either lead to stability or instability, which confirms and extends a result found in Ref. [START_REF] Per | Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching[END_REF]. Decaying couplings strength have also been considered in analogy with higher-order phase reduction techniques discussed in the next section. The multi-order Laplacian is also applied to other models of simplicial complexes, such as the simplicial star-clique model, and real-world brain system. The multi-order Laplacian is a general tool that can be used to investigate the effects of higher-order interactions in other oscillatory systems. Jhun et al. [START_REF] Jhun | Simplicial SIS model in scale-free uniform hypergraph[END_REF] extended the simplicial contagion model discussed in Sec. VII A 1 to the more general case of hypergraphs. The SIS-like model works exactly as the one proposed by Iacopini et al. [START_REF] Iacopini | Simplicial models of social contagion[END_REF], but this time the spreading process takes place on top of d-uniform hypergraphs in which all the hyperedges have the same size d. As for the simplicial model, a susceptible node that is part of a hyperedge α of size d can get an infection from α, with rate β d , only if the remaining d-1 nodes composing α are infectious. As for the recovery, the standard recovery probability µ is used. The authors considered the case of scale-free (SF) uniform hypergraphs. Notice that even if all the hyperedges have the same size, different nodes can belong to a different number of these hyperedges. In this sense, the heterogeneity is given by the number of hyperedges a node belongs to, which is distributed as ∼ P (k) γ . The heterogeneous mean-field formalism (HMF)-in which nodes of the same hyperdegree class as considered equivalent [START_REF] Pastor | Epidemic spreading in scale-free networks[END_REF]-leads to the following equation for the evolution of the stationary density of infected nodes of hyperdegree k:

The contagion term on the r.h.s. considers the probability that a susceptible node of hyperdegree k gets the infection from one of the hyperedges. This is, as usual, proportional to the infection rate β k , the number of hyperedges k, and the probability Θ d-1 to be connected to a hyperedge having all the other nodes infected. A comparison of Eq. ( 59) with Eq. ( 58) highlights the difference in the representation used. Indeed, differently from the simplicial case, here the contagion term does not dependent on the lower order sub-faces.

The resulting phase diagram of the model for a 3-uniform hypergraph is reported in Fig. 30A, where the stationary density of infected nodes ρ is plotted against the re-scaled control parameter λ ≡ β µ for different values of the SF exponent γ. The system presents a characteristic exponent γ c = 2 + 1 (d -2) of the degree distribution that determines the nature of the transition. In particular, for γ < γ c the epidemic threshold vanishes (λ c = 0), as it is confirmed by the finite value of the susceptibility χ reported in Fig. 30B. By contrast, if γ = γ c a second order transition appears, that becomes hybrid when higher values of γ are considered (see curves for γ = 2.6 and 2.8). The associated values of the susceptibility diverge at the transition point, as expected [START_REF] Lübeck | Universal scaling behavior of non-equilibrium phase transitions[END_REF][START_REF] Ferreira | Epidemic thresholds of the susceptible-infectedsusceptible model on networks: A comparison of numerical and theoretical results[END_REF]. These results are consistent with simulations on SF uniform hypergraphs, confirming the validity of the HMF approach on such topologies.

Another version of the higher-order social contagion model on hypergraph was recently proposed by de Arruda et al. [START_REF] Ferraz De Arruda | Social contagion models on hypergraphs[END_REF]. Based on a similar SIS framework, the fundamental difference with respect to the other models relies on the explicit inclusion of a critical-mass dynamics into the contagion process that generalizes the one in Ref. [START_REF] Iacopini | Simplicial models of social contagion[END_REF]. In the simplicial contagion model previously discussed, a susceptible node i belonging to hyperedge α (or a simplex) of size d could get the infection from α only if all the remaining d -1 nodes composing it are infected. Here, the authors relax the constraints by (i) moving from simplicial complexes to hypergraphs and (ii) allowing a hyperedge α to be potentially infectious for i ∈ α if the number of infected nodes composing α is greater or equal to a given threshold Θ α . The standard SIS model is then recovered by restricting this threshold mechanism to hyperedges of size greater than two, so that a contagion through active links can always happen (no threshold). This model reveals a similar phenomenology to the one on simplices, characterized by the appearance of first and second-order transitions and