Graphs have been utilized as a powerful tool to model pairwise relationships between people or objects. Such structure is a special type of a broader concept referred to as hypergraph, in which each hyperedge may consist of an arbitrary number of nodes, rather than just two. A large number of real-world datasets are of this form - for example, list of recipients of emails sent from an organization, users participating in a discussion thread or subject labels tagged in an online question. However, due to complex representations and lack of adequate tools, little attention has been paid to exploring the underlying patterns in these interactions.
In this work, we empirically study a number of real-world hypergraph datasets across various domains. In order to enable thorough investigations, we introduce the multi-level decomposition method, which represents each hypergraph by a set of pairwise graphs. Each pairwise graph, which we refer to as a k-level decomposed graph, captures the interactions between pairs of subsets of k nodes. We empirically find that at each decomposition level, the investigated hypergraphs obey five structural properties. These properties serve as criteria for evaluating how realistic a hypergraph is, and establish a foundation for the hypergraph generation problem. We also propose a hypergraph generator that is remarkably simple but capable of fulfilling these evaluation metrics, which are hardly achieved by other baseline generator models.
Structural Controllability of Large-Scale Hypergraphs
Eric and Wendy Schmidt Center at the Broad Institute of MIT and Harvard(MIT和哈佛大学布罗德研究所的埃里克和wendy Schmidt中心);School of Data Science and Society, University of North Carolina at Chapel Hill(夏洛特希尔大学数据科学与社会学院);Department of Biostatistics, University of North Carolina at Chapel Hill(夏洛特希尔大学生物统计学系)
School of Airspace Science and Engineering, Shandong University(航空航天科学与工程学院,山东大学);School of Mathematics and Statistics, Shandong University(数学与统计学院,山东大学)
Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs
Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)(可扩展数据分析和人工智能中心);Max Planck Institute for Mathematics in the Sciences (MPI MIS), Leipzig, Germany(德国莱比锡马克斯·普朗克科学数学研究所);DataShape, Inria-Saclay, France(法国萨克雷Inria DataShape团队)