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...
Gorde:
| Egile Nagusiak: | , , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
SpringerOpen
2020-06-01
|
| Saila: | EPJ Data Science |
| Gaiak: | |
| Sarrera elektronikoa: | http://link.springer.com/article/10.1140/epjds/s13688-020-00231-0 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|