Node and Edge Nonlinear Eigenvector Centrality for Hypergraphs

Author name not available (Why is that?)

Publication date: 15 January 2021

Abstract: Network scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency matrix. Recent work indicates that there are further benefits from accounting directly for higher order interactions, notably through a hypergraph representation where an edge may involve multiple nodes. Building on these ideas, we motivate, define and analyze a class of spectral centrality measures for identifying important nodes and hyperedges in hypergraphs, generalizing existing network science concepts. By exploiting the latest developments in nonlinear Perron-Frobenius theory, we show how the resulting constrained nonlinear eigenvalue problems have unique solutions that can be computed efficiently via a nonlinear power method iteration. We illustrate the measures on realistic data sets.

Has companion code repository: https://github.com/ftudisco/node-edge-hypergraph-centrality

This page was built for publication: Node and Edge Nonlinear Eigenvector Centrality for Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358373)