Abstract
In this paper, we propose a new multirank method based on topologically biased random walks for simultaneously ranking the nodes and layers in multilayer networks, referred to as the topologically biased random walks (TBRW) centrality. The centrality of nodes and layers are obtained by developing an iterative algorithm for solving a set of tensor equations. Under some conditions, the existence of such centrality is also proven. Furthermore, the convergence of the proposed iterative algorithm is established. Numerical experiments on two real-world multilayer networks (i.e., multiplex citation network and European Air Transportation Networks) are carried out to show the effectiveness of the proposed algorithm and to compare it to other existing centrality measures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.