Fig. 10: Validated vs. non-validated ‘hypergraph to network’’ projections of empirical datasets.
From: Entropy-based models to randomise real-world hypergraphs
a–c projections of the contact-primary-school, email-Enron and NDC-classes data sets onto the layer of nodes. d–f validated counterparts of the aforementioned projections: any two nodes are linked if they share a significantly large number of hyperedges. Communities have been detected by running the Louvain algorithm.
