Node and edge nonlinear eigenvector centrality for hypergraphs
Evaluating the importance of nodes and hyperedges in hypergraphs is relevant to link detection, link prediction and matrix completion. Here, the authors define a family of nonlinear eigenvector centrality measures for both edges and nodes in hypergraphs, propose an algorithm to calculate them, and i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2021-09-01
|
| Series: | Communications Physics |
| Online Access: | https://doi.org/10.1038/s42005-021-00704-2 |