# Patterns in Temporal Networks with Higher-Order Egocentric Structures

Beatriz Arregui-García, Antonio Longa, Quintino Francesco Lotito, Sandro

Meloni, Giulia Cencetti

► To cite this version:

Beatriz Arregui-García, Antonio Longa, Quintino Francesco Lotito, Sandro Meloni, Giulia Cencetti. Patterns in Temporal Networks with Higher-Order Egocentric Structures. Entropy, 2024, 26 (3), pp.256. 10.3390/e26030256. doi:10.3390/e26030256

HAL Id: hal-04911456

https://hal.science/hal-04911456v1

Submitted on 24 Jan 2025

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
Article

# Patterns in Temporal Networks with Higher-Order Egocentric Structures

Beatriz Arregui-García<fnref n="1" />,*, Antonio Longa<fnref n="2" />,†, Quintino Francesco Lotito<fnref n="2" />, Sandro Meloni<fnref n="1" /> and Giulia Cencetti <fnref n="3" />,*

**Abstract:** The analysis of complex and time-evolving interactions, such as those within social dynamics, represents a current challenge in the science of complex systems. Temporal networks stand as a suitable tool for schematizing such systems, encoding all the interactions appearing between pairs of individuals in discrete time. Over the years, network science has developed many measures to analyze and compare temporal networks. Some of them imply a decomposition of the network into small pieces of interactions; i.e., only involving a few nodes for a short time range. Along this line, a possible way to decompose a network is to assume an egocentric perspective; i.e., to consider for each node the time evolution of its neighborhood. This was proposed by Longa et al. by defining the "egocentric temporal neighborhood", which has proven to be a useful tool for characterizing temporal networks relative to social interactions. However, this definition neglects group interactions (quite common in social domains), as they are always decomposed into pairwise connections. A more general framework that also allows considering larger interactions is represented by higher-order networks. Here, we generalize the description of social interactions to hypergraphs. Consequently, we generalize their decomposition into "hyper egocentric temporal neighborhoods". This enables the analysis of social interactions, facilitating comparisons between different datasets or nodes within a dataset, while considering the intrinsic complexity presented by higher-order interactions. Even if we limit the order of interactions to the second order (triplets of nodes), our results reveal the importance of a higher-order representation. In fact, our analyses show that second-order structures are responsible for the majority of the variability at all scales: between datasets, amongst nodes, and over time.

**Keywords:** temporal hypergraphs; social interactions; motifs

## 1. Introduction

Networks, characterized by interconnected nodes and edges, have become essential tools for modeling a multitude of phenomena, ranging from social interactions to biological and physical systems [1–3].

While they have proven to be a valuable framework, networks frequently fail to capture the entire complexity of real-world systems. For example, they can only capture static interactions, while many real-world interactions tend to be dynamic; i.e., they are established and destroyed during the life of a system. These nuances are better captured by more sophisticated frameworks, such as temporal networks [4,5], in which edges are labeled with timestamps representing their temporal activations. We use temporal networks to describe the synchronous activation of remote areas of the brain [6], social networks [7], blockchain [8], mobility [9], communications [10], and the rapidly varying physical interactions between individuals in a closed environment [11–13].

<figure><img src="image_2.png" /></figure>

check for
updates

**Citation:** Arregui-García, B.; Longa, A.; Lotito, Q.F.; Meloni, S.; Cencetti, G. *Patterns in Temporal Networks with Higher-Order Egocentric Structures*. *Entropy* **2024**, *26*, 256. https://doi.org/10.3390/e26030256

Academic Editors: Tiziano Squartini, Fernando António Nóbrega Santos, Rossana Mastrandrea and Marco Piangerelli

Received: 7 February 2024

Revised: 4 March 2024

Accepted: 11 March 2024

Published: 13 March 2024

<figure><img src="image_3.png" /></figure>

**Copyright:** © 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

<footnote n="1">¹ Instituto de Física Interdisciplinar y Sistemas Complejos IFISC (CSIC-UIB), Campus UIB, 07122 Palma de Mallorca, Spain</footnote>

<footnote n="2">² DISI Department of Information Engineering and Computer Science, University of Trento, 38123 Trento, Italy; antonio.longa@unitn.it (A.L.)</footnote>

<footnote n="3">³ Aix-Marseille Univ, Université de Toulon, CNRS, CPT, 13009 Marseille, France</footnote>

<footnote>* Correspondence: giulia.cencetti@cpt.univ-mrs.fr</footnote>
The flexibility of temporal networks in describing time-varying interactions comes at the cost of a more complex representation and analysis. Several tools have been proposed in the literature to cope with the complexity of adding the temporal dimension to network analysis, including methods for community detection [14,15], dense subgraph discovery [16–19], surrogate network generation [20], and visualization [21]. Despite such complexity, capturing more fine-grained information about the temporal properties of networks is fundamental, as temporal links affect the dynamics in networks, including random walks [22], epidemics [23,24], and other diffusion [25] and evolutionary [26] processes.

To identify relevant structures in temporal networks and describe node behavior through time, it could be useful to decompose networks into small pieces [27–33], i.e., a few nodes and their connections for limited temporal snapshots [28,29], and to use these repeated patterns to characterize and compare different networks [34]. Along this line, one possible strategy is to assume a so-called *egocentric perspective*, as recently proposed by Longa et al. [35]. This approach consists of considering the evolution of the neighborhood of a node for a small number of temporal layers. These small temporal subgraphs can be collected for every node of a network and at every time step. The entire set of egocentric temporal neighborhoods (ETN) can be reduced to a smaller set of only significant structures with respect to a null model, egocentric temporal motifs (ETM). ETNs and ETMs allow for the efficient identification of repeated interaction patterns among individuals in social settings. The ego perspective indeed simplifies motif identification by comparing egocentric temporal sub-networks using a signature, a bit vector, thus avoiding the computational complexities associated with standard motif mining (which usually includes the graph isomorphism problem). However, a drawback of this approach is that it neglects connections among the neighbors of the ego node at each timestamp, thus destroying correlations in the creation of links between different ego nodes, a feature of paramount importance, for example, in temporal social interactions [36].

In recent years, and to take into account such more complex structures, a new branch of network science has emerged with the study of higher-order networks [37,38]. In this approach, mathematical tools like hypergraphs can be used to represent interactions that can involve any number of nodes at the same time, effectively extending the concept of edges to hyperedges. The number of involved nodes defines the order of the hyperedge: first order for pairs of nodes, second order for triads, and so on. Recently, considerable attention has been dedicated to the exploration and understanding of hypergraphs, from microscale [31–33] and mesoscale properties [39–44], to centrality [45,46], hyperedge overlap [47], and clustering measures [48,49]. Higher-order interactions have been proven to affect a variety of dynamical processes in networks; for instance, random walks [50], spreading [51], and synchronization [52]. Moreover, temporal features of group interactions have been investigated under different lenses [36,53–58]. Finally, hypergraphs have found applications in describing, for instance, scientific collaborations [59], relations among species in ecosystems [60–62], cognitive associations [63], and simultaneous group interactions in social environments [36,64], among others.

Given these two different views, the node egocentric on one side and the higher-order on the other, the idea of combining them naturally arises. We therefore investigate how to characterize temporal networks via higher-order egocentric structures. In order to do this, we generalize the concept of ETN from graphs to hypergraphs, defining the hyper egocentric temporal neighborhood (HETN). This new framework will allow taking into account more complex information, including hyperedges and their time evolution. We analyzed 10 datasets of social interactions. To give a thorough representation of such complex and time-evolving systems, we made use of temporal hypergraphs with hyperedges up to the second order (larger interactions were decomposed into groups of three nodes). HETNs encode a description of the temporal hypergraph at the micro-scale with an egocentric perspective. We used them to compare different datasets and different nodes inside a dataset. Our results make manifest the importance of the second order of interactions in describing
temporal dynamics, as they are responsible for a large part of the variability observed at all scales: between datasets, amongst individuals, and even for the same individual, over time.

## 2. Methods

### 2.1. Hyper Egocentric Temporal Neighborhood

We define a temporal hypergraph $\mathcal{H} = (V, E)$ as an ensemble comprising a set of nodes $V$ and a set of temporal hyperedges $E$ that encode the higher-order interactions between nodes and the time at which they take place. Time is discrete and represented by natural numbers. For simplicity, we consider hyperedges up to the second order of interactions, i.e., involving three nodes at maximum. The hyperedges of the first order can be represented as triplets $(i, j, t)$, where $i, j \in V$ and $t \in [0, T]$. Hyperedges of the second order are depicted as quadruplets $(i, j, k, t)$, where $i, j, k \in V$. Here, $t$ denotes the time at which the interaction takes place and $T$ corresponds to the time of the last temporal layer in the hypergraph. A temporal hypergraph snapshot is a static graph that represents one temporal layer of $\mathcal{H}$ and includes only interactions taking place at a specific time. It is defined as $\mathcal{H}_t = (V, E_t)$, where $E_t$ is the set of hyperedges $(i, j)$ and $(i, j, k)$ that are associated to time $t$.

We can now define the hyper egocentric temporal neighborhood (HETN), by extending to hypergraphs the concept introduced by [35] for simple graphs.

To do that, we first need to define the hyper egocentric neighborhood of a designated node $v \in V$; i.e., the ego node, as the subgraph $\mathcal{H}_t(v)$ of $\mathcal{H}_t$ comprising all hyperedges that include $v$ at time $t$; i.e., first-order edges $(v, j)$ and second-order edges $(v, j, k)$.

Thus, a HETN of time-length $k$, $\mathcal{H}_t^k(v)$, is defined as the sequence of $k$ temporal hypergraph snapshots starting from time $t$: $\{\mathcal{H}_t(v), \mathcal{H}_{t+1}(v), \dots, \mathcal{H}_{t+k}(v)\}$. In a HETN, every node is linked to its next occurrence (if any) in the sequence (see Figure 1a). In other words, $\mathcal{H}_t^k(v)$ is a temporal subgraph of $\mathcal{H}$ including the higher-order neighborhood of node $v$ for $k$ temporal layers starting from time $t$. In the rest of this work, following the analyses performed in [35], we set the time-length of the HETN to $k=2$, i.e., $\mathcal{H}_t^2(v)$, to reduce the complexity of the signatures and thus produce a concise representation of the datasets.

### 2.2. Hyper Egocentric Temporal Neighborhood Signatures

All the HETNs of a temporal hypergraph can be encoded into binary signatures. Extending the algorithm proposed in [35], the encoding at first order consists in assigning, at every time $(t, t+1, \dots, t+k)$, a 1 if the link between the node $v$ and a neighbor $j$ exists at that time or a 0 otherwise. This results in a binary key for every node $j \neq v \in \mathcal{H}_t^k(v)$. The extension of the encoding to the second order is performed by keeping track of the triangles (second-order interactions) in which the ego node $v$ participates. A binary key is assigned for every possible dyadic interaction between nodes other than the ego node, giving a total of $n(n-1)/2$, where $n$ is the total number of nodes in the HETN excluding the ego node. In Figure 1, for example, we can see how the key encoding the temporal interaction between the ego node and node C is “011”, as the edge $(v, C)$ does not exist at time $t$ but exists at $t+1$ and $t+2$. A similar case is found for the triangle composed of the ego node and vertices B and C, which would be encoded by the key associated with the edge $(B, C)$ and which results in “011”.

Once we have the binary keys encoding the dyadic (first order) and triangle interactions (second order), we proceed to defining the key for the particular HETN by sorting lexicographically the first order encoding. The new sorting at the first order will define the sorting of the second order. For the particular case shown in Figure 1, we would have $011-111-111-111-111$ ($C-A-B-D-E$) and consequently $100-000-000-111-011-000-000-000-000-001$ ($CA-CB-CD-CE-AB-AD-AE-BD-BE-DE$). Finally, we will concatenate the first- and second-order keys: $011-111-111-111-111-100-000-000-111-011-000-000-000-000-001$. This vector is named the *hyper egocentric temporal neighborhood signature* (HETNS).
<figure><img src="image_4.png" /><figcaption>**Figure 1. The HETN-gen model: (panel a) Schematization of a hyper egocentric temporal neighborhood with (k = 2) and (panel b) its corresponding encoding at first and second order. (panel c) Hyper egocentric temporal neighborhood signature (HETNS) describing the HETN in (a).**</figcaption></figure>

This encoding method shows its limitations when encountering isomorphic subgraphs. In fact, while the main advantage of encoding at first order is that it bypasses the problem of isomorphic HETNs [35], this is not always possible at the second order. In fact, when there is a multiplicity of keys at the first order, several encodings may be present at second order. For instance, the example in Figure 1 could also have been sorted as C - A - B - E - D (and 22 other extra combinations) at first order, resulting in a different second-order key for the very same HETN. Thus, in the event that there is a multiplicity of keys at the first order, every possible sorting combination must be checked at the second order, in order to index isomorphic HETNs under the same, unique, HETNS. In theory, this task becomes rapidly computationally unfeasible, since every element duplicated n times means n! possible sort combinations. However, in practice, given the sparseness of interactions of the datasets and aggregation times (see the datasets and hypergraphs subsection, below) considered, the number of non-computable cases is negligible. This allows us to compute the HETNS of each dataset in a few minutes.

A binary signature allows storing a high number of HETNs. This, in turn, lets us characterize any node in a temporal hypergraph or the entire temporal hypergraph as a whole. Indeed, to characterize a single node v according to this algorithm, it is sufficient to build the vector of frequencies of every HETN where v participates as the ego node. These can be obtained for each time t using a sliding window over time. Instead, to describe a whole temporal hypergraph, we analyze the HETN of all nodes with their frequencies together. We denote these HETN-based descriptions as node (hypergraph) embedding, $EMB(v)$ ($EMB(H)$).

Using this notation, we can consider all the HETNSs as the basis of a vector space and their frequencies as the coordinates. This allows the comparison of two nodes (hypergraphs) $v_1$ and $v_2$ ($H_1$ and $H_2$) by computing a cosine distance between the embedding vectors as

$$ dist(X_1, X_2) = \left( 1 - \frac{\text{EMB}(X_1) \cdot \text{EMB}(X_2)}{\|\text{EMB}(X_1)\| \|\text{EMB}(X_2)\|} \right) \quad (1) $$

where X represents either a node v or a hypergraph H.
## 2.3. Hyper Egocentric Temporal Motifs

The set of HETNs of a hypergraph can include very basic structures with high frequency, which are common to all hypergraphs, as we will see below. For some applications, it is hence useful to filter them out and reduce the analysis to a smaller set of HETNs that are significant for describing that specific hypergraph. This filtering procedure makes use of a null model that assumes no temporal correlations between the interactions. We obtain a null model $\tilde{\mathcal{H}}$ of $\mathcal{H}$ by randomly shuffling the hypergraph temporal snapshots $\{\mathcal{H}_1, \mathcal{H}_2, \dots, \mathcal{H}_T\}$ in which $\mathcal{H}$ may be split.

We consider HETNSs from $\mathcal{H}$ as significant when they satisfy the following requirements:

* Over-representation: $P(\tilde{N}_{\tilde{\mathcal{H}}} > N_{\mathcal{H}}) < \alpha$;

* Minimum deviation: $N_{\mathcal{H}} - \tilde{N}_{\tilde{\mathcal{H}}} \geq \beta \tilde{N}_{\tilde{\mathcal{H}}}$;

* Minimum frequency: $N_{\mathcal{H}} \geq \gamma$.

where $N_{\mathcal{H}}$ is the number of occurrences of a HETNS in $\mathcal{H}$, $\tilde{N}_{\tilde{\mathcal{H}}}$ is the average number of occurrences of the same HETNS in $\tilde{\mathcal{H}}$, and where we set $\alpha = 0.01$, $\beta = 0.1$ and $\gamma = 5$, respectively. We refer to the resulting significant HETNS as a *hyper egocentric temporal motif* (HETM). As in the HETNS case, we denote as $\text{EMB}_{\text{HETM}}(\mathcal{H})$ the embedding vector describing the graph $\mathcal{H}$ based on their HETM frequencies. Frequencies are normalized by the maximum frequency in each vector.

## 2.4. Datasets And Hypergraphs

To validate our algorithm, we evaluated it across ten proximity contact networks. Nine of them modeled face-to-face interactions and were collected using wearable proximity sensors (radio-frequency identification (RFID) tags) during the SocioPatterns project http://www.sociopatterns.org/ (accessed on 1 December 2023). The devices recorded face-to-face interactions between users, and the data were made available as pairwise interactions with a temporal resolution of 20 seconds. Table 1 shows the number of nodes, the number of edges, and the durations (in days) for each of the following datasets:

* Three high schools, containing interactions between students and professors, gathered at a high school in Marseille (France) in the years 2011, 2012, and 2013 [65,66]. Metadata inform about the class of each student or the role of the professors.

* A primary school, containing interactions between students and teachers, collected in a French primary school [67,68].

* Two workplaces, containing interactions between co-workers in an office building in France in 2013 and 2015 [69,70].

* A hospital, containing interactions between workers and patients, collected in the geriatric ward of a university hospital in Lyon (France) [71]. Metadata inform about the role of each individual (medical doctors, patients, nurses, and administrative staff).

* A scientific conference, containing interactions between the attendees [70].

* A primate dataset, containing the interactions between Guinea baboons living in an enclosure at the CNRS Primate Center in Rousset-sur-Arc (France) [72].

In addition, we also analyzed a dataset of proximity contacts collected via Bluetooth technology. Here, the interactions depended only on physical distance and did not always imply an active interplay among people. These data were gathered at a university campus (at the Technical University of Denmark, DTU), where a group of freshman students participated for a month using phones that provided physical proximity information using Bluetooth tech [73]. We analyzed a sample of these data comprising just one week of interactions.
<table><caption>**Table 1. Dataset statistics:** Number of nodes, number of edges, and duration (in days) for each network.</caption><thead><tr><td>Name</td><td>|V|</td><td>|E|</td><td>Duration</td></tr></thead><tbody><tr><td>Conference</td><td>403</td><td>70,261</td><td>1.32</td></tr><tr><td>Primates</td><td>13</td><td>63,095</td><td>28</td></tr><tr><td>High school 11</td><td>126</td><td>28,561</td><td>3.1</td></tr><tr><td>High school 12</td><td>180</td><td>45,047</td><td>8.44</td></tr><tr><td>High school 13</td><td>327</td><td>188,508</td><td>4.2</td></tr><tr><td>Primary school</td><td>242</td><td>125,773</td><td>1.35</td></tr><tr><td>Workplace 13</td><td>92</td><td>9827</td><td>11.4</td></tr><tr><td>Workplace 15</td><td>217</td><td>78,249</td><td>11.5</td></tr><tr><td>Hospital</td><td>75</td><td>32,424</td><td>4</td></tr><tr><td>DTU Bluetooth</td><td>656</td><td>717,669</td><td>7</td></tr></tbody></table>

All these datasets come as a list of temporal pairwise interactions. Each term is encoded as $(i, j, t)$, where $i$ and $j$ represent individuals, i.e., the nodes of our hypergraphs, and $t$ is the time at which the interaction took place. To build a hypergraph from these data, we need to choose a temporal interval $\Delta t$ that would become the time resolution of the temporal hypergraph. The timestamps appearing in the dataset were hence divided into slots of length $\Delta t$ and all the interactions that took place between $t$ and $t + \Delta t$ were stored as interactions taking place at time $t$ in the hypergraphs. We called $\Delta t$ *aggregation time*. Moreover, we divided interactions into first- and second-order; i.e., if in an interval there were the interactions $(i, j)$, $(j, k)$, and $(k, i)$, we considered this a unique second-order hyperlink $(i, j, k)$. We encoded this interaction as a hyperedge of second order, instead of three first-order edges. Larger values of $\Delta t$ resulted in a larger number of interactions being included in each temporal snapshot, thus also increasing the probability of forming second-order interactions. While we considered the idea of extending the analysis to third or higher order interactions, we found that across the social contact data examined, the number of simultaneous interactions involving four or more agents diminished rapidly. Therefore, in order to make a comparison between datasets with statistically significant samples, we limited the analysis to second-order effects only.

In the following, we show the results obtained for several temporal hypergraphs generated from the above datasets using different aggregation times $\Delta t$. We start by comparing the different datasets using the distance metric defined in Equation (1) based on their $EMB_{ETM}(\mathcal{H})$. Afterwards, we zoom in on individual nodes and compute their HETNS. We then compute the distances among them, obtaining distance matrices that we represent using a multidimensional scaling technique. This is a dimensionality-reduction technique that consists of translating the values of a distance matrix into an $n$-dimension representation by preserving the distances in the $n$-dimension space. In our case, we use an Euclidean representation. This technique allows visualizing similarities among nodes computed from their HETNS composition, while also pointing out the different roles of the nodes given by the contact metadata. We analyze the node's HETNS nature with a focus on distinguishing the contribution provided by the pure first- and pure second-order HETNS. Finally, we look at the temporal coherence of a node with itself by also looking at its HETNS embedding at different times.

### 3. Results

We start our analysis with HETMs, which only include the significant structures with respect to the null model. As expected, the number of distinct HETMs in real temporal hypergraphs varies with datasets and aggregation time, as shown in Figure 2a. We can observe that from all the distinct HETMs appearing for each dataset (continuous lines), the number of second-order HETMs (dashed lines) is quite large, even for low aggregation times, and this calls for a deeper analysis. We can observe that increasing the aggregation time makes the number of different HETMs increase for both first and second orders. Considering larger aggregation times indeed implies that a larger number of nodes interact
with the ego node, thus increasing the complexity and hence the variability in the HETM structures. The abundance of each HETM, i.e., the number of times that a HETM appeared in the network, is reported in Figure 2b for the *Hospital* dataset. Again, although, for each aggregation time analyzed, the first four most frequent HETMs only involved pairwise interactions, starting from the fifth first and second-order HETMs seemed to be equally likely. Finally, in the following analyses, we choose a small aggregation time (2.5 min), because we recall that choosing a value of $\Delta t$ implies considering interactions taking place in that range as simultaneous, which can only be considered a good approximation for ranges of a few minutes.

<figure><img src="image_5.png" /><figcaption>**Figure 2.** HETM counts and abundance: (panel a) Average number of distinct hyper egocentric temporal motifs (HETMs) per temporal layer in proximity contact data for different aggregations of time $\Delta t$ and $k = 2$. Continuous lines correspond to first- and second-order HETMs, and dashed lines to pure second-order HETMs. (panel b) Rank plot of the abundance of HETMs in the *Hospital* data (excluding the 20% less common HETMs) for different aggregation times. Points in grey indicate the first-order HETMs and points in red are second-order HETMs.</figcaption></figure>

The set of HETMs obtained from a temporal hypergraph schematizes the behavior of the nodes of that specific hypergraph with respect to their neighborhood. Then, they can be used to characterize and compare different datasets. To do so, we defined the distance between two datasets as the inverse of the cosine similarity between the two corresponding vectors of HETM frequency embeddings (see definition in Methods). Figure 3 shows the matrix of pairwise distances between all the considered datasets. The top panel reports the distances computed considering all the HETMs, while the bottom panels were obtained by only using purely first- and purely second-order HETMs, respectively. From the top panel, we can notice a slight clusterization between datasets of the same kind; for instance, the three high school datasets showed a higher similarity among them than with the other datasets, and the same happened to the two workplaces. We can indeed suppose that people inside similar environments (like students at schools) tend to follow similar patterns of behavior. The Bluetooth dataset instead appeared more distant from the others, probably because of the different technology that implied a larger variety of interactions. Bluetooth data, in fact, record the co-location between individuals, not only face-to-face, so a recorded connection between two nodes means that the corresponding individuals are in the same area, but not necessarily interacting. This resulted in larger groups and hence the appearance of more complex HETNs than for the other datasets. Interestingly, distances at the first order were smaller with respect to considering both types of interactions, suggesting that first-order HETMs were very similar between datasets. On the contrary, the second-order HETMs showed generally larger distances among datasets and accentuated the distance of the Bluetooth dataset from the others.
<figure><img src="image_6.png" /><figcaption>**Figure 3.** HETM-based distances: (panel a) Distance matrix among datasets based on HETMs. Results are shown for $\Delta t = 2.5$ min and $k = 2$. (panel b) Distances computed by only considering the first- or second-order HETMs, respectively. Color bars are represented in a logarithmic scale. In both panels, the highlighted measures correspond to equal settings sampled over different years.</figcaption></figure>

If the hyper egocentric temporal neighborhoods observed in one network characterize the corresponding dataset, those found for one node characterize the behavior of the corresponding individual. We hence used them to compare individuals and identify classes of behaviors. By using a distance metric analogous to the one used above, we implemented a multidimensional scaling; i.e., we positioned nodes in a 2D-space according to the reciprocal distance (see Methods). Notice that for the node analysis in (Figures 4 and 5), we made use of the entire set of HETNs, not only the HETMs. In fact, the concept of HETM has been defined to characterize a hypergraph and not singular nodes; the structures that are significant for a hypergraph do not necessarily coincide with the structures that are significant for a node. Since the concept of significance for a node (or a group of nodes) is not a trivial matter, we chose to use all the collected HETNs to characterize a node.
<figure><img src="image_7.png" /><figcaption>**Figure 4.** HETN-based node distances for single networks: Multidimensional scaling of HETN-based distances at single node level with $\Delta t = 2.5$ min and $k = 2$ for two different proximity contact datasets: *Hospital* (upper panels) and *High School'11* (lower panels). We show the multidimensional scaling accounting for all the HETNs (left panels) and those obtained considering only first- (central panels) and second- (right panels) order HETNs. The size of the nodes is proportional to the number of different HETNs that each node presented. In the *Hospital* dataset (upper panels), the color of the nodes corresponds to the four different classes: administrative staff (green), medical doctor (orange), paramedical staff (purple), or patient (blue). In the *High School'11* dataset (lower panels), the color of the nodes depends on whether the node is a teacher (green) or a student belonging to three different classes: PC* (orange), PSI* (purple), or PC (blue).</figcaption></figure>

In Figure 4, we report for two datasets (*High School'11* and *Hospital*) the multidimensional scaling of the node distances. The size of the nodes provides information on the number of different HETNs: larger nodes have a larger variety of HETNs. In addition, each node may belong to a different class (information provided by metadata), which is represented by its color. For both datasets, three panels are shown: the distances obtained comparing all HETNS, those obtained from the first order only, and those from the second order only, respectively.

<figure><img src="image_8.png" /><figcaption>**Figure 5.** HETN-based node distances in multiple networks: (upper panels) Multidimensional scaling of HETN-based distances at single node level for $\Delta t = 2.5$ min and $k = 2$ for the 10 different types of social contact data considering both (left), first- (middle), and second- (right) order HETNs. (lower panels) Each row shows the five most frequent HETNs in their corresponding patch displayed in the cartography above. The percentage of each HETN indicates the percentage at which that signature appeared among all the HETNs of the nodes in the patch.</figcaption></figure>
From the comparison between all HETNS (first- and second-order together) for the *High School'11* dataset (lower panels of Figure 4), we can notice a central cloud containing 98% of the nodes. In this cloud, we see that nodes representing students in different classes (PC*, PSI* and PC) are well mixed, while ones corresponding to teachers are located on the edge of the cloud. Moreover, this last group has, on average, a smaller size, meaning that they presented less variety in behavior. For the *Hospital* (upper panels of Figure 4), we can observe a higher dispersion, but we can easily appreciate that the separation between different classes of nodes partially reflects the metadata. Indeed, we notice a small cluster corresponding to the patients, which is also the class showing the lowest number of different HETNs. This cluster is surrounded by that of the administrative staff and another, more dispersed, cluster composed of medics. Nurses are instead spread around, suggesting a more varied behavior, which is not characterized by a small group of specific HETNs as for the other classes.

Again, when we restrict the analysis to the first order, we can observe in both cases a behavior similar to the previous one, with a similar clustering of the nodes. The main difference is represented by the fact that the clouds are smaller, implying a generally higher similarity between individuals. On the other hand, the second-order panels exhibit more dispersed clouds, with distances approximately twice those computed for the first order. This means that the second order reveals a higher variability in temporal neighborhoods among different nodes, something that could not be appreciated if limiting the analysis to the first order.

After analyzing individual HETNSs within each dataset, it might also be instructive to investigate whether classes of behaviors appear consistently across datasets. To do that, in Figure 5, we report the multidimensional scaling for all the nodes of all the analyzed datasets, where different node colors identify different datasets. Again, we show the results for all HETNs and those for the first order only and the second order only.

By analyzing the first and second orders together, we notice that most of the nodes are concentrated in the central part of the plane; i.e., many HETNSs are shared among datasets. There, we can find the smaller and simpler structures, mainly involving the first order (as can be seen by the five most frequent ones collected in region A and reported at the bottom). These are common to all datasets. Moving away from that central region, more complex structures start to appear, involving the second order too. Here, the datasets started to differentiate: the two workplaces rapidly disappear (implying that only very basic structures are present in these datasets); some other datasets (*Primates*, *Conference*, *Hospital*, and the high schools) showed only a few individuals that behaved differently from the majority; while the *Primary school* and the *DTU Bluetooth* were very spread out in space, with a large variety of behaviors. In the peripheral region B, we notice that second-order structures, quite uncommon in region A, are not only present but significant, also appearing among the five most frequent HETNs.

The central panel of Figure 5, depicting the results limited to the first order, shows a different pattern, where most of the datasets are collapsed in the middle and only a few nodes are differentiated. Here, the two regions A and B, central and peripheral, show very similar and simple structures(four HETNs out of five are common to the two areas). Moreover, in both cases, the five reported structures cover more than 25% of the structures (60% for the central region). The variability between possible structures that we find at the first order is hence very limited.

In contrast, the second-order structures (right panel) form a larger cloud, where all nodes are more spread out, revealing a larger variability in second-order HETNs for the nodes of all datasets (except for the primates dataset). Here, there is no particular region where the concentration of points is denser than in the others. This reveals that there are not many structures that are common to different nodes, as confirmed by observing the reported structures below: the most frequent HETN in each region covers less than the 25% of the total (less than the 5% for the outer region).
Finally, having analyzed the HETNS variability among datasets and between nodes, we can also study how individuals change their behavior over time. In Figure 6, instead of comparing different nodes, we compare each node with itself at different times. In particular, we divide the time series of interactions into daily intervals ($[T_0, T_1, \dots, T_N]$). The HETNs extracted for one node at $T_0$ are hence compared with those extracted for the same node in $T_1$; the same for $T_1-T_2$ up to $T_{N-1}-T_N$. The panels report the distribution of the distances computed for all the nodes considering all orders together, the purely first-order and the purely second-order, respectively. The difference between the overall behavior for first and second orders is even greater, with distances that pass from an average of around 0.24 for the first order only to an average of around 0.90 for the second order.

Taken together, our results show that a high variability between second-order structures (both among different nodes and among different temporal intervals of the same node) is always observed. This supports the idea that a higher-order analysis is hence needed to distinguish the social behaviors of different nodes and in different datasets. Focusing only on first-order structures is indeed limiting, because most of the extracted HETNs are trivial and common to all nodes and to all datasets, and do not allow revealing singular peculiarities. To clean the data from these trivial structures requires the use of a null model (as we did in the HETM analysis), which can however introduce biases. The second-order structures instead allow more refined analyses.

<figure><img src="image_9.png" /><figcaption>**Figure 6.** Temporal distance distributions: This is computed for every node with itself comparing their HETN embeddings for $\Delta t = 2.5$ min and $k = 2$. Distances are calculated evaluating the HETN embedding of each node in consecutive daily time windows for each dataset. Each *pdf* is normalized so that the total area of each histogram equals one.</figcaption></figure>

## 4. Conclusions

Considering the temporal dimension is fundamental to understand social interactions, and, in this sense, temporal networks provide a unique tool for their analysis. Nevertheless, capturing and modeling all the complexity of temporal interactions is an open question in network science.

To represent these temporal structures, egocentric temporal neighborhoods/motifs have emerged as a concise yet powerful tool for analyzing and modeling their dynamics. Focusing only on ego nodes and their connections allows us to analyze each node individually and represent the evolution of the network in a parsimonious way. In recent years, however, a new paradigm has emerged highlighting the role of higher-order structures in shaping the dynamics of social systems. In this approach, the emphasis is on correlations in the interactions between neighbors of the ego nodes: something that the original definition of temporal neighborhoods neglects in its construction [35]. Thus, the question of how relevant are higher-order interactions for the modeling of this class of dynamics naturally arose.

To answer this question, in this work, we used a generalization of temporal graphs to temporal hypergraphs, and we extended the concept of egocentric temporal neighborhoods to include second-order interactions—connections involving two neighbors of the ego node that are also interacting—for defining hyper egocentric temporal neighborhoods. This extension allowed the analysis of several datasets from face-to-face interactions covering
different contexts and aggregation times. The datasets ranged from interactions between students in primary and high schools, to workplaces and hospitals, and baboons living in a research facility.

While first-order signatures were more abundant, as expected, second-order ones still played an important role. In fact, they were present in the most frequent structures in all datasets, with their signatures being statistically relevant even for larger aggregation times.

Interestingly, we also found that, at the whole hypergraph level, first-order structures were way more similar than second-order ones, with the latter showing a larger variability and diversity. This translates into most of the differences between hypergraphs being due to second-order HETMs.

This same result also holds if we zoom in at the individual node level: second-order structures are more sensitive to node dissimilarities. Moreover, inside each dataset, these distances between node signatures allowed better clustering of individuals according to their function; i.e., nodes with similar functions such as patients or administrative staff in the *Hospital* dataset showed similar signatures.

Finally, looking at distances between signatures of the same nodes at different periods in time, we demonstrated that second-order structures also showed a higher temporal variability.

Taken together, our results demonstrate that, while first-order HETMs provide a backbone for social interactions, second-order ones are fundamental for capturing their heterogeneities at all scales: the whole network, between nodes, and temporally, even at the individual level. This picture demonstrates, once more, the relevance of higher-order structures in shaping social and network dynamics in general.

However, the extension of egocentric temporal neighborhoods to second-order motifs comes at a cost. Second-order encodings, unlike first-order ones, are not unique, forcing us to test for isomorphic patterns; a major disadvantage that first-order analysis overcame. However, this limitation is mainly theoretical. For all the datasets and aggregation times considered, the computational costs of the isomorphism tests were almost negligible, with a running time for computing nodes' signatures of a few minutes for the largest dataset and the longest aggregation time. A second limitation of our work is the fact that we limited our analyses to second-order motifs, instead of considering third- or even higher-order structures. However, their limited number suggests that most of the connections of the networks would have been covered by only considering first- and second-order HETMs.

In conclusion, with this work, we demonstrate that considering hyper egocentric temporal motifs in the analysis of temporal datasets is fundamental for capturing the intrinsic variability in social interactions.

We indeed observed non-trivial patterns in the way group interactions appear, in how they evolve in a short time range, and in how they are related to each other when taking place at the same time. The method that we propose, based on HETMs and HETNs, is able to simplify these pieces of information and encode them in binary signatures, which is useful for storing and comparing them, and which could be useful for further research. Future researchers could benefit from this method to help characterize their temporal higher-order data or to classify them into universality classes based on these signatures. Modeling and generation of synthetic surrogates is one direct and foreseeable application of this method that we envisage exploring in further work.

**Author Contributions:** Conceptualization, S.M. and G.C.; Methodology, B.A.-G., A.L., Q.F.L. and S.M.; Software, B.A.-G. and A.L.; Validation, B.A.-G., Q.F.L., S.M. and G.C.; Formal analysis, B.A.-G.; Investigation, B.A.-G., A.L., Q.F.L. and S.M.; Resources, Q.F.L.; Data curation, B.A.-G. and A.L.; Writing—original draft, B.A.-G., Q.F.L., S.M. and G.C.; Writing—review & editing, S.M. and G.C.; Supervision, S.M. and G.C. All authors have read and agreed to the published version of the manuscript.

**Funding:** B.A.G. is partially supported by María de Maeztu Program for Centers and Units of Excellence in R&D, grant MDM-2017-0711 funded by MCIN/AEI/10.13039/501100011033. B.A.G. and S.M. acknowledge funding from the APASOS project PID2021-122256NB-C22 funded MCIN/AEI/10.13039/501100011033/FEDER, UE (Away to make Europe) and by the María de Maeztu Program for Centers
and Units of Excellence in R&D, grant CEX2021-001164-M funded by the MCIN/AEI/10.13039/501100011033. A.L. acknowledges the support of the MUR PNRR project FAIR—Future AI Research (PE00000013) funded by the NextGenerationEU. G.C. acknowledges the support of the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No. 101103026.

**Data Availability Statement:** The data that support the findings of this study are openly available in http://www.sociopatterns.org/.

**Conflicts of Interest:** The authors declare no conflict of interest.

## References

1. Newman, M. *Networks*; Oxford University Press: Oxford, UK, 2018.

2. Pósfai, M.; Barabási, A.L. *Network Science*; Cambridge University Press: Cambridge, UK, 2016.

3. Boccaletti, S.; Latora, V.; Moreno, Y.; Chavez, M.; Hwang, D.U. Complex Networks: Structure and Dynamics. *Phys. Rep.* **2006**, *424*, 175–308. [CrossRef]

4. Holme, P.; Saramäki, J. Temporal Networks. *Phys. Rep.* **2012**, *519*, 97–125. [CrossRef]

5. Masuda, N.; Lambiotte, R. *A Guide to Temporal Networks*; World Scientific: Singapore, 2016.

6. Bassett, D.S.; Wymbs, N.F.; Porter, M.A.; Mucha, P.J.; Carlson, J.M.; Grafton, S.T. Dynamic reconfiguration of human brain networks during learning. *Proc. Natl. Acad. Sci. USA* **2011**, *108*, 7641–7646. [CrossRef] [PubMed]

7. Lachi, V.; Dimitri, G.M.; Di Stefano, A.; Liò, P.; Bianchini, M.; Mocenni, C. Impact of the Covid 19 outbreaks on the italian twitter vaccination debate: A network based analysis. *arXiv* **2023**, arXiv:2306.02838.

8. Galdeman, A.; Zignani, M.; Gaito, S. Disentangling the Growth of Blockchain-based Networks by Graph Evolution Rule Mining. In *Proceedings of the 2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)*, Shenzhen, China, 13–16 October 2022; pp. 1–10.

9. Simini, F.; Barlacchi, G.; Luca, M.; Pappalardo, L. A deep gravity model for mobility flows generation. *Nat. Commun.* **2021**, *12*, 6576. [CrossRef] [PubMed]

10. Pan, R.K.; Saramäki, J. Path lengths, correlations, and centrality in temporal networks. *Phys. Rev. E* **2011**, *84*, 016105. [CrossRef]

11. Barrat, A.; Cattuto, C. Temporal networks of face-to-face human interactions. In *Temporal Networks*; Springer: Berlin/Heidelberg, Germany, 2013; pp. 191–216.

12. Chowdhury, S.N.; Majhi, S.; Ozer, M.; Ghosh, D.; Perc, M. Synchronization to extreme events in moving agents. *New J. Phys.* **2019**, *21*, 073048. [CrossRef]

13. Chowdhury, S.N.; Majhi, S.; Ghosh, D. Distance dependent competitive interactions in a frustrated network of mobile agents. *IEEE Trans. Netw. Sci. Eng.* **2020**, *7*, 3159–3170. [CrossRef]

14. Gauvin, L.; Panisson, A.; Cattuto, C. Detecting the community structure and activity patterns of temporal networks: A non-negative tensor factorization approach. *PLoS ONE* **2014**, *9*, e86028. [CrossRef]

15. Peixoto, T.P.; Rosvall, M. Modelling sequences and temporal networks with dynamic community structures. *Nat. Commun.* **2017**, *8*, 582. [CrossRef]

16. Galimberti, E.; Barrat, A.; Bonchi, F.; Cattuto, C.; Gullo, F. Mining (Maximal) Span-Cores from Temporal Networks. In *Proceedings of the 27th ACM International Conference on Information and Knowledge Management, Torino, Italy, 22–26 October 2018; Association for Computing Machinery: New York, NY, USA, 2018; CIKM’18*, pp. 107–116.

17. Semertzidis, K.; Pitoura, E.; Terzi, E.; Tsaparas, P. Finding lasting dense subgraphs. *Data Min. Knowl. Discov.* **2019**, *33*, 1417–1445. [CrossRef]

18. Lotito, Q.F.; Montresor, A. Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs. *arXiv* **2020**, arXiv:2009.01928.

19. Preti, G.; Rozenshtein, P.; Gionis, A.; Velegrakis, Y. Discovering Dense Correlated Subgraphs in Dynamic Networks. In *Pacific-Asia Conference on Knowledge Discovery and Data Mining*; Springer: Cham, Switzerland, 2021; pp. 395–407.

20. Longa, A.; Cencetti, G.; Lehmann, S.; Passerini, A.; Lepri, B. Generating fine-grained surrogate temporal networks. *Commun. Phys.* **2024**, *7*, 22. [CrossRef]

21. Perri, V.; Scholtes, I. Visualisation of temporal network data via time-aware static representations with Hotvis. In *Proceedings of the Companion Proceedings of the Web Conference 2021, Ljubljana, Slovenia, 19–23 April 2021*; pp. 533–534.

22. Starnini, M.; Baronchelli, A.; Barrat, A.; Pastor-Satorras, R. Random walks on temporal networks. *Phys. Rev. E* **2012**, *85*, 056115. [CrossRef] [PubMed]

23. Valdano, E.; Ferreri, L.; Poletto, C.; Colizza, V. Analytical computation of the epidemic threshold on temporal networks. *Phys. Rev. X* **2015**, *5*, 021005. [CrossRef]

24. Masuda, N.; Holme, P. Predicting and controlling infectious disease epidemics using temporal networks. *F1000prime Rep.* **2013**, *5*, 6. [CrossRef] [PubMed]

25. Masuda, N.; Klemm, K.; Eguíluz, V.M. Temporal networks: Slowing down diffusion by long lasting interactions. *Phys. Rev. Lett.* **2013**, *111*, 188701. [CrossRef]
26. Li, A.; Zhou, L.; Su, Q.; Cornelius, S.P.; Liu, Y.Y.; Wang, L.; Levin, S.A. Evolution of cooperation on temporal networks. *Nat. Commun.* **2020**, *11*, 2259. [CrossRef]

27. Milo, R.; Shen-Orr, S.; Itzkovitz, S.; Kashtan, N.; Chklovskii, D.; Alon, U. Network Motifs: Simple Building Blocks of Complex Networks. *Science* **2002**, *298*, 824–827. [CrossRef]

28. Kovanen, L.; Karsai, M.; Kaski, K.; Kertész, J.; Saramäki, J. Temporal Motifs in Time-Dependent Networks. *J. Stat. Mech. Theory Exp.* **2011**, P11005. [CrossRef]

29. Paranjape, A.; Benson, A.R.; Leskovec, J. Motifs in Temporal Networks. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, Cambridge, UK, 6–10 February 2017; pp. 601–610.

30. Battiston, F.; Nicosia, V.; Chavez, M.; Latora, V. Multilayer motif analysis of brain networks. *Chaos Interdiscip. J. Nonlinear Sci.* **2017**, *27*, 047404. [CrossRef] [PubMed]

31. Lee, G.; Ko, J.; Shin, K. Hypergraph Motifs: Concepts, Algorithms, and Discoveries. *Proc. VLDB Endow.* **2020**, *13*, 2256–2269. [CrossRef]

32. Lotito, Q.F.; Musciotto, F.; Montresor, A.; Battiston, F. Higher-order motif analysis in hypergraphs. *Commun. Phys.* **2022**, *5*, 79. [CrossRef]

33. Lotito, Q.F.; Musciotto, F.; Battiston, F.; Montresor, A. Exact and sampling methods for mining higher-order motifs in large hypergraphs. *arXiv* **2023**, arXiv:2209.10241.

34. Milo, R.; Itzkovitz, S.; Kashtan, N.; Levitt, R.; Shen-Orr, S.; Ayzenshtat, I.; Sheffer, M.; Alon, U. Superfamilies of Evolved and Designed Networks. *Science* **2004**, *303*, 1538–1542. [CrossRef]

35. Longa, A.; Cencetti, G.; Lepri, B.; Passerini, A. An efficient procedure for mining egocentric temporal motifs. *Data Min. Knowl. Discov.* **2022**, *36*, 355–378. [CrossRef]

36. Cencetti, G.; Battiston, F.; Lepri, B.; Karsai, M. Temporal properties of higher-order interactions in social networks. *Sci. Rep.* **2021**, *11*, 7028. [CrossRef]

37. Battiston, F.; Cencetti, G.; Iacopini, I.; Latora, V.; Lucas, M.; Patania, A.; Young, J.G.; Petri, G. Networks beyond pairwise interactions: Structure and dynamics. *Phys. Rep.* **2020**, *874*, 1–92. [CrossRef]

38. Battiston, F.; Amico, E.; Barrat, A.; Bianconi, G.; Ferraz de Arruda, G.; Franceschiello, B.; Iacopini, I.; Kéfi, S.; Latora, V.; Moreno, Y.; et al. The physics of higher-order interactions in complex systems. *Nat. Phys.* **2021**, *17*, 1093–1098. [CrossRef]

39. Carletti, T.; Fanelli, D.; Lambiotte, R. Random walks and community detection in hypergraphs. *J. Phys. Complex.* **2021**, *2*, 015011. [CrossRef]

40. Eriksson, A.; Edler, D.; Rojas, A.; de Domenico, M.; Rosvall, M. How choosing random-walk model and network representation matters for flow-based community detection in hypergraphs. *Commun. Phys.* **2021**, *4*, 133. [CrossRef]

41. Contisciani, M.; Battiston, F.; De Bacco, C. Inference of hyperedges and overlapping communities in hypergraphs. *Nat. Commun.* **2022**, *13*, 7229. [CrossRef]

42. Ruggeri, N.; Contisciani, M.; Battiston, F.; De Bacco, C. Community detection in large hypergraphs. *Sci. Adv.* **2023**, *9*, eadg9159. [CrossRef]

43. Lotito, Q.F.; Musciotto, F.; Montresor, A.; Battiston, F. Hyperlink communities in higher-order networks. *arXiv* **2023**, arXiv:2303.01385.

44. Tudisco, F.; Higham, D.J. Core-periphery detection in hypergraphs. *SIAM J. Math. Data Sci.* **2023**, *5*, 1–21. [CrossRef]

45. Benson, A.R. Three Hypergraph Eigenvector Centralities. *SIAM J. Math. Data Sci.* **2019**, *1*, 293–312. [CrossRef]

46. Tudisco, F.; Higham, D.J. Node and edge nonlinear eigenvector centrality for hypergraphs. *Commun. Phys.* **2021**, *4*, 1–10. [CrossRef]

47. Lee, G.; Choe, M.; Shin, K. How Do Hyperedges Overlap in Real-World Hypergraphs?-Patterns, Measures, and Generators. In Proceedings of the WWW’21: The Web Conference 2021, Ljubljana, Slovenia, 19–23 April 2021; pp. 3396–3407.

48. Benson, A.R.; Abebe, R.; Schaub, M.T.; Jadbabaie, A.; Kleinberg, J. Simplicial Closure and Higher-Order Link Prediction. *Proc. Natl. Acad. Sci. USA* **2018**, *115*, E11221–E11230. [CrossRef]

49. Kartun-Giles, A.P.; Bianconi, G. Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks. *Chaos Solitons Fractals* **2019**, *1*, 100004. [CrossRef]

50. Carletti, T.; Battiston, F.; Cencetti, G.; Fanelli, D. Random Walks on Hypergraphs. *Phys. Rev. E* **2020**, *101*, 022308. [CrossRef] [PubMed]

51. Iacopini, I.; Petri, G.; Barrat, A.; Latora, V. Simplicial Models of Social Contagion. *Nat. Commun.* **2019**, *10*, 2485. [CrossRef]

52. Gambuzza, L.; Di Patti, F.; Gallo, L.; Lepri, S.; Romance, M.; Criado, R.; Frasca, M.; Latora, V.; Boccaletti, S. Stability of synchronization in simplicial complexes. *Nat. Commun.* **2021**, *12*, 1255. [CrossRef]

53. Comrie, C.; Kleinberg, J. Hypergraph Ego-networks and Their Temporal Evolution. In Proceedings of the 2021 IEEE International Conference on Data Mining (ICDM), Auckland, New Zealand, 7–10 December 2021; pp. 91–100. [CrossRef]

54. Ceria, A.; Wang, H. Temporal-topological properties of higher-order evolving networks. *Sci. Rep.* **2023**, *13*, 5885. [CrossRef]

55. Gallo, L.; Lacasa, L.; Latora, V.; Battiston, F. Higher-order correlations reveal complex memory in temporal hypergraphs. *arXiv* **2023**, arXiv:2303.09316.

56. Iacopini, I.; Karsai, M.; Barrat, A. The temporal dynamics of group interactions in higher-order social networks. *arXiv* **2023**, arXiv:2306.09967.
57. Di Gaetano, L.; Battiston, F.; Starnini, M. Percolation and topological properties of temporal higher-order networks. *Phys. Rev. Lett.* **2024**, *132*, 037401. [CrossRef]

58. Mancastroppa, M.; Iacopini, I.; Petri, G.; Barrat, A. The structural evolution of temporal hypergraphs through the lens of hyper-cores. *arXiv* **2024**, arXiv:2402.06485.

59. Lung, R.I.; Gaskó, N.; Suciu, M.A. A hypergraph model for representing scientific output. *Scientometrics* **2018**, *117*, 1361–1379. [CrossRef]

60. Grilli, J.; Barabás, G.; Michalska-Smith, M.J.; Allesina, S. Higher-Order Interactions Stabilize Dynamics in Competitive Network Models. *Nature* **2017**, *548*, 210. [CrossRef] [PubMed]

61. Levine, J.M.; Bascompte, J.; Adler, P.B.; Allesina, S. Beyond Pairwise Mechanisms of Species Coexistence in Complex Communities. *Nature* **2017**, *546*, 56. [CrossRef]

62. Chatterjee, S.; Nag Chowdhury, S.; Ghosh, D.; Hens, C. Controlling species densities in structurally perturbed intransitive cycles with higher-order interactions. *Chaos Interdiscip. J. Nonlinear Sci.* **2022**, *32*, 103122. [CrossRef] [PubMed]

63. Citraro, S.; Warner-Willich, J.; Battiston, F.; Siew, C.S.; Rossetti, G.; Stella, M. Hypergraph models of the mental lexicon capture greater information than pairwise networks for predicting language learning. *New Ideas Psychol.* **2023**, *71*, 101034. [CrossRef]

64. Sahasrabuddhe, R.; Neuhäuser, L.; Lambiotte, R. Modelling non-linear consensus dynamics on hypergraphs. *J. Phys. Complex.* **2021**, 2, 025006. [CrossRef]

65. Fournet, J.; Barrat, A. Contact patterns among high school students. *PLoS ONE* **2014**, *9*, e107878. [CrossRef] [PubMed]

66. Mastrandrea, R.; Fournet, J.; Barrat, A. Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys. *PLoS ONE* **2015**, *10*, e0136497. [CrossRef] [PubMed]

67. Stehlé, J.; Voirin, N.; Barrat, A.; Cattuto, C.; Isella, L.; Pinton, J.F.; Quaggiotto, M.; Van den Broeck, W.; Régis, C.; Lina, B.; et al. High-resolution measurements of face-to-face contact patterns in a primary school. *PLoS ONE* **2011**, *6*, e23176. [CrossRef] [PubMed]

68. Gemmetto, V.; Barrat, A.; Cattuto, C. Mitigation of infectious disease at school: Targeted class closure vs school closure. *BMC Infect. Dis.* **2014**, *14*, 695. [CrossRef] [PubMed]

69. Génois, M.; Vestergaard, C.L.; Fournet, J.; Panisson, A.; Bonmarin, I.; Barrat, A. Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers. *Netw. Sci.* **2015**, *3*, 326–347. [CrossRef]

70. Génois, M.; Barrat, A. Can co-location be used as a proxy for face-to-face contacts? *EPJ Data Sci.* **2018**, *7*, 11. [CrossRef]

71. Vanhems, P.; Barrat, A.; Cattuto, C.; Pinton, J.F.; Khanafer, N.; Régis, C.; Kim, B.a.; Comte, B.; Voirin, N. Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors. *PLoS ONE* **2013**, *8*, 1–9. [CrossRef]

72. Gelardi, V.; Godard, J.; Paleressompoulle, D.; Claidiere, N.; Barrat, A. Measuring social networks in primates: Wearable sensors versus direct observations. *Proc. R. Soc. Math. Phys. Eng. Sci.* **2020**, *476*, 20190737. [CrossRef] [PubMed]

73. Sapiezynski, P.; Stopczynski, A.; Lassen, D.D.; Lehmann, S. Interaction data from the Copenhagen Networks Study. *Sci. Data* **2019**, *6*, 315. [CrossRef] [PubMed]

**Disclaimer/Publisher's Note:** The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.