• A modified efficiency centrality to identify influential nodes in weighted networks

    • Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pram/092/04/0068

    • Keywords

       

      Complex network; influential nodes; weighted network; efficiency centrality

    • Abstract

       

      It is still a crucial issue to identify influential nodes effectively in the study of complex networks. As for the existing efficiency centrality (EffC), it cannot be applied to a weighted network. In this paper, a modified efficiency centrality ($\rm{EffC}^{m}$) is proposed by extending EffC into weighted networks. The proposed measure trades off the node degree and global structure in a weighted network. The influence of both the sum of the average degree of nodes in the whole network and the average distance of the network is taken into account. Numerical examples are used to illustrate the efficiency of the proposed method.

    • Author Affiliations

       

      YUNCHUAN WANG1 SHASHA WANG2 YONG DENG3 4 5

      1. School of Electronic Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
      2. School of Computer Science, Sichuan University, Chengdu, China
      3. Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu, China
      4. Big Data Decision Institute, Jinan University, Guangzhou, China
      5. School of Computer and Information Science, Southwest University, Chongqing, China
    • Dates

       
  • Pramana – Journal of Physics | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.