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...
Spremljeno u:
| Glavni autori: | , , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
SpringerOpen
2020-06-01
|
| Serija: | EPJ Data Science |
| Teme: | |
| Online pristup: | http://link.springer.com/article/10.1140/epjds/s13688-020-00231-0 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|