How Do Hyperedges Overlap in Real-World Hypergraphs? - Patterns, Measures, and Generators
Geon Lee, Minyoung Choe, Kijung Shin
Abstract
Hypergraphs, a generalization of graphs, naturally represent groupwise relationships among multiple individuals or objects, which are common in many application areas, including web, bioinformatics, and social networks. The flexibility in the number of nodes in each hyperedge, which provides the expressiveness of hypergraphs, brings about structural differences between graphs and hypergraphs. Especially, the overlaps of hyperedges lead to complex high-order relations beyond pairwise relations, raising new questions that have not been considered in graphs: How do hyperedges overlap in real-world hypergraphs? Are there any pervasive characteristics? What underlying process can cause such patterns?
Topics & Concepts
Pairwise comparisonGeneralizationComputer scienceFlexibility (engineering)Theoretical computer scienceOrder (exchange)Artificial intelligenceMathematicsStatisticsBusinessMathematical analysisFinanceComplex Network Analysis TechniquesGraph Theory and AlgorithmsData Visualization and Analytics