Hypernetwork science via high-order hypergraph walks
Hypernetwork science via high-order hypergraph walks
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
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...
Alternative Titles
Full title
Hypernetwork science via high-order hypergraph walks
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_37ca1d86fecc49409e4722e1bafaa0ba
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_37ca1d86fecc49409e4722e1bafaa0ba
Other Identifiers
ISSN
2193-1127
E-ISSN
2193-1127
DOI
10.1140/epjds/s13688-020-00231-0
