Skip to main content
EPJ Data Science
Figure 1 | EPJ Data Science

Figure 1

From: The simpliciality of higher-order networks

Figure 1

An illustration of simpliciality. Simpliciality captures the notion of inclusion in higher-order networks. (A) Interaction data are fully simplicial, denoted \(\sigma =1\), when all possible included interactions exist, e.g., an interaction between three nodes appears together with interactions between all three possible pairings of these nodes. Data are minimally simplicial, denoted \(\sigma =0\), when no included interactions are present. (B-D) Three natural measures of simpliciality which place higher-order datasets on the simplicial spectrum between \(\sigma =0\) and \(\sigma =1\), as described in Sect. 2.1

Back to article page