arXiv Analytics

Sign in

arXiv:1711.08448 [cs.SI]AbstractReferencesReviewsResources

Node and layer eigenvector centralities for multiplex networks

Francesco Tudisco, Francesca Arrigo, Antoine Gautier

Published 2017-11-22Version 1

Eigenvector-based centrality measures are among the most popular centrality measures in network science. The underlying idea is intuitive and the mathematical description is extremely simple in the framework of standard, mono-layer networks. Moreover, several efficient computational tools are available for their computation. Moving up in dimensionality, several efforts have been made in the past to describe an eigenvector-based centrality measure that generalizes Bonacich index to the case of multiplex networks. In this work, we propose a new definition of eigenvector centrality that relies on the Perron eigenvector of a multi-homogeneous map defined in terms of the tensor describing the network. We prove that existence and uniqueness of such centrality are guaranteed under very mild assumptions on the multiplex network. Extensive numerical studies are proposed to test the newly introduced centrality measure and to compare it to other existing eigenvector-based centralities.

Related articles: Most relevant | Search more
arXiv:1909.03916 [cs.SI] (Published 2019-09-09)
Community Detection via Katz and Eigenvector Centrality
arXiv:1801.08026 [cs.SI] (Published 2018-01-24)
A New Framework for Centrality Measures in Multiplex Networks
arXiv:2309.07617 [cs.SI] (Published 2023-09-14)
Influence Robustness of Nodes in Multiplex Networks against Attacks