Eigenvector centrality measure based on node similarity for multilayer and temporal networks

19Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Centrality of nodes is very useful for understanding the behavior of systems and has recently attracted plenty of attention from researchers. In this paper, we propose a new eigenvector centrality based on node similarity for ranking nodes in multilayer and temporal networks under the framework of tensor computation, referred to as the ECMSim. We define a fourth-order tensor to represent the multilayer and temporal networks. The relationships between different layers(or time stamps) can be depicted by using node similarity. Based on the defined tensor, we establish the tensor equation to obtain nodes centrality values. The nodes centrality values also can be viewed as the Perron eigenvector of a multi-homogeneous map. Furthermore, we show the existence and uniqueness of the proposed centrality measure by existing results. Numerical experiments are carried out to demonstrate that the proposed centrality outperforms some existing ranking methods.

Cite

CITATION STYLE

APA

Lv, L., Zhang, K., Zhang, T., Li, X., Zhang, J., & Xue, W. (2019). Eigenvector centrality measure based on node similarity for multilayer and temporal networks. IEEE Access, 7, 115725–115733. https://doi.org/10.1109/ACCESS.2019.2936217

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free