Identifying the most influential nodes in networked systems is vital to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards higher-order networks has rendered them void of performance guarantees. We propose a new measure of nodes centrality, which is no longer a scalar value, but a vector with dimension one lower than the highest order of interaction in the graph. Such a vectorial measure is linked to the eigenvector centrality for networks containing only pairwise interactions, whereas it has a significant added value in all other situations where interactions occur at higher-orders. In particular, it is able to unveil different roles which may be played by a same node at different orders of interactions, an information which is impossible to be retrieved by single scalar measures.
Download