18 October 2023 in Expert Systems with Applications
1 August 2023 in IEEE Transactions on Computational Social Systems
The identification of important nodes (vertexes) in multilayer networks has aroused many scholars’ attention and various centrality methods have deen developed. However, the current centralities ignore the impact of community structure on node importance. In this article, we define a community-based centrality for finding key vertexes in multilayer networks, referred to as the CBCM. We first construct a multilayer network model with interlayer edges, which is represented by a fourth-order tensor. Based on the fourth-order tensor, we develop a centrality, called PR_BIS, to measure the importance of vertexes and network layers in multilayer networks, simultaneously. CBCM determines the importance of a vertex in each network layer by combining the following three factors: the PageRank centrality score of the vertex, the importance of the community where the vertex is located, and the ability of the vertex within a community to affect vertexes in other communities within two steps. Based on the importance of all the network layers measured by PR_BIS centrality, we perform weighted fusion for the importance of a vertex in all network layers to obtain the importance of the vertex in multilayer networks. Finally, numerical experiments are performed on several multilayer networks to verify the effectiveness and superiority of CBCM and PR_BIS.
12 January 2026 in IEEE Access
Identifying key nodes in multiplex networks is a fundamental problem in the field of network science, which has attracted widespread attention from many scholars. In recent decades, various centrality methods have been proposed for identifying key nodes in multiplex networks. However, these existing methods only utilize the single structural information of multiplex network, resulting in unsatisfactory performance of algorithms. In this paper, we define a simple and effective multiplex centrality based on Dempster -Shafer(MCBDS) evidence theory, which combines local and semi-local information of networks. The proposed centrality trades off between the multi-degree centrality and Supra-Laplacian centrality values of every node in multiplex networks. The influences of both the multi-degree and Supra-Laplacian of each node are represented by basic probability assignment(BPA), which consists of elements high and low. High and low are the absolute values of the difference between the centrality value of node i and the maximum and minimum centrality values of all nodes, respectively. Therefore, BPA can represent the degree of trust in node i being an important node and the degree of trust in node i not being an important node when using multi-degree or Supra-Laplacian centrality to measure node importance. Then, the MCBDS is proposed by combining these BPAs. In the simulation experiment, we compare the performance of our proposed centrality with other existing centrality methods on three real-world multiplex networks by introducing Linear Threshold(LT) model and resolution entropy(RE) index. The experimental results indicate that our proposed centrality algorithm is a competitive and effective centrality algorithm.