Hypernetwork science via high-order hypergraph walks
Abstract 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 connecte...
Uloženo v:
| Hlavní autoři: | , , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
SpringerOpen
2020-06-01
|
| Edice: | EPJ Data Science |
| Témata: | |
| On-line přístup: | http://link.springer.com/article/10.1140/epjds/s13688-020-00231-0 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|