Journal
EPJ DATA SCIENCE
Volume 9, Issue 1, Pages -Publisher
SPRINGER
DOI: 10.1140/epjds/s13688-020-00231-0
Keywords
Hypergraph; High-order walk; Generative model
Funding
- High Performance Data Analytics (HPDA) program at the Department of Energy's Pacific Northwest National Laboratory
- Battelle Memorial Institute [DE-ACO6-76RL01830]
- PNNL [PNNL-SA-144766]
Ask authors/readers for more resources
We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods which then generalize to hypergraphs include connected component analyses, graph distance-based metrics such as closeness centrality, and motif-based measures such as clustering coefficients. We apply high-order analogs of these methods to real world hypernetworks, and show they reveal nuanced and interpretable structure that cannot be detected by graph-based methods. Lastly, we apply three generative models to the data and find that basic hypergraph properties, such as density and degree distributions, do not necessarily control these new structural measurements. Our work demonstrates how analyses of hypergraph-structured data are richer when utilizing tools tailored to capture hypergraph-native phenomena, and suggests one possible avenue towards that end.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available