IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v399y2014icp57-69.html
   My bibliography  Save this article

A new method of identifying influential nodes in complex networks based on TOPSIS

Author

Listed:
  • Du, Yuxian
  • Gao, Cai
  • Hu, Yong
  • Mahadevan, Sankaran
  • Deng, Yong

Abstract

In complex networks, identifying influential nodes is the very important part of reliability analysis, which has been a key issue in analyzing the structural organization of a network. In this paper, a new evaluation method of node importance in complex networks based on technique for order performance by similarity to ideal solution (TOPSIS) approach is proposed. TOPSIS as a multiple attribute decision making (MADM) technique has been an important branch of decision making since then. In addition, TOPSIS is first applied to identify influential nodes in a complex network in this open issue. In different types of networks in which the information goes by different ways, we consider several different centrality measures as the multi-attribute of complex network in TOPSIS application. TOPSIS is utilized to aggregate the multi-attribute to obtain the evaluation of node importance of each node. It is not limited to only one centrality measure, but considers different centrality measures, because every centrality measure has its own disadvantage and limitation. Then, we use the Susceptible–Infected (SI) model to evaluate the performance. Numerical examples are given to show the efficiency and practicability of the proposed method.

Suggested Citation

  • Du, Yuxian & Gao, Cai & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2014. "A new method of identifying influential nodes in complex networks based on TOPSIS," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 399(C), pages 57-69.
    • Handle: RePEc:eee:phsmap:v:399:y:2014:i:c:p:57-69
    DOI: 10.1016/j.physa.2013.12.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437113011552
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2013.12.031?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    2. Mendes, G.A. & da Silva, L.R. & Herrmann, H.J., 2012. "Traffic gridlock on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 362-370.
    3. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    4. Cai Gao & Xin Lan & Xiaoge Zhang & Yong Deng, 2013. "A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks," PLOS ONE, Public Library of Science, vol. 8(6), pages 1-11, June.
    5. Liu, Jian-Guo & Ren, Zhuo-Ming & Guo, Qiang, 2013. "Ranking the spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(18), pages 4154-4159.
    6. Galam, Serge & Zucker, Jean-Daniel, 2000. "From individual choice to group decision-making," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 287(3), pages 644-659.
    7. Shih, Hsu-Shih, 2008. "Incremental analysis for MCDM with an application to group TOPSIS," European Journal of Operational Research, Elsevier, vol. 186(2), pages 720-734, April.
    8. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    9. Hu, Hai-Bo & Wang, Xiao-Fan, 2008. "Unified index to quantifying heterogeneity of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3769-3780.
    10. Wang, Yi & Cao, Jinde & Jin, Zhen & Zhang, Haifeng & Sun, Gui-Quan, 2013. "Impact of media coverage on epidemic spreading in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(23), pages 5824-5835.
    11. Awasthi, Anjali & Chauhan, Satyaveer S. & Goyal, S.K., 2010. "A fuzzy multicriteria approach for evaluating environmental performance of suppliers," International Journal of Production Economics, Elsevier, vol. 126(2), pages 370-378, August.
    12. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    13. Bai, Wen-Jie & Zhou, Tao & Wang, Bing-Hong, 2007. "Immunization of susceptible–infected model on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 384(2), pages 656-662.
    14. Lu, Zhe-Ming & Guo, Shi-Ze, 2012. "A small-world network derived from the deterministic uniform recursive tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 87-92.
    15. Sun, Peng Gang & Yang, Yang, 2013. "Methods to find community based on edge centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 1977-1988.
    16. Campiteli, M.G. & Holanda, A.J. & Soares, L.D.H. & Soles, P.R.C. & Kinouchi, O., 2013. "Lobby index as a network centrality measure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5511-5515.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    2. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    3. Liu, Jie & Li, Yunpeng & Ruan, Zichan & Fu, Guangyuan & Chen, Xiaowu & Sadiq, Rehan & Deng, Yong, 2015. "A new method to construct co-author networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 29-39.
    4. Berahmand, Kamal & Bouyer, Asgarali & Samadi, Negin, 2018. "A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 41-54.
    5. Zhu, Hengmin & Yin, Xicheng & Ma, Jing & Hu, Wei, 2016. "Identifying the main paths of information diffusion in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 320-328.
    6. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    7. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    8. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    9. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    10. Fei, Liguo & Deng, Yong, 2017. "A new method to identify influential nodes based on relative entropy," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 257-267.
    11. Salavati, Chiman & Abdollahpouri, Alireza & Manbari, Zhaleh, 2018. "BridgeRank: A novel fast centrality measure based on local structure of the network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 635-653.
    12. Wang, Yanhui & Bi, Lifeng & Lin, Shuai & Li, Man & Shi, Hao, 2017. "A complex network-based importance measure for mechatronics systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 180-198.
    13. Yuan, Jia & Zhang, Qian-Ming & Gao, Jian & Zhang, Linyan & Wan, Xue-Song & Yu, Xiao-Jun & Zhou, Tao, 2016. "Promotion and resignation in employee networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 442-447.
    14. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    15. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.
    16. Singh, Priti & Chakraborty, Abhishek & Manoj, B.S., 2017. "Link Influence Entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 701-713.
    17. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    18. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    19. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Shokrollahi, Arman, 2015. "Improving detection of influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 833-845.
    20. Chen, Yahong & Li, Jinlin & Huang, He & Ran, Lun & Hu, Yusheng, 2017. "Encouraging information sharing to boost the name-your-own-price auction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 108-117.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:399:y:2014:i:c:p:57-69. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.