Fig. 8: Graphical representation of the ‘hypergraph to graph’ projection.
From: Entropy-based models to randomise real-world hypergraphs
Notice that while the degree of each node (i.e., the number of hyperedges that are incident to it) reads {ki} = (3, 3, 3, 3, 4, 1), the sigma of each node (i.e., the total number of hyperedges shared by it with any other node or, equivalently, the strength on the projection) reads {σi} = (8, 8, 9, 6, 10, 3) and the kappa of each node (i.e., the number of nodes it shares an hyperedge with or, equivalently, the degree on the projection) reads {κi} = (5, 4, 5, 4, 5, 3).
