IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v180y2024ics0960077924000365.html
   My bibliography  Save this article

Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks

Author

Listed:
  • Wang, Yan
  • Zhang, Ling
  • Yang, Junwen
  • Yan, Ming
  • Li, Haozhan

Abstract

Identifying super-propagators on social networks takes on critical significance in guiding and controlling public opinions on the internet, information retrieval, viral marketing and so on. The influence of nodes is enhanced under the dual role of network structure and dynamic interactions, while existing research tends to attach great importance on the network structure. This means the interaction behaviors between nodes are ignored, which indicates that the performance of algorithms still needs to be improved. Moreover, only a minority of work has been conducted on directed weighted networks. To address these problems, from the perspectives of the network topology and dynamic interaction, a multi-factor information matrix centrality algorithm is developed in this study in accordance with the characteristics of information propagation process and three degrees of influence rule, with the node influence, neighbor influence, and mutual influence exerted by information feedback considered simultaneously. Based on this, the subjective and objective weighted methods are combined to enhance the accuracy of evaluation results, then the multi-factor matrix can be obtained. Four comparative experiments are employed to verify the effectiveness of proposed method with ten networks and nine existing centralities applied. The results of the experiments confirm the validity and superiority of the proposed method in terms of differentiation, connectivity and propagation performance. Moreover, its low time complexity makes the algorithm can be used in large-scale social networks. In general, methodological and multidimensional support is provided for the accurate identification of super-propagators in online social networks.

Suggested Citation

  • Wang, Yan & Zhang, Ling & Yang, Junwen & Yan, Ming & Li, Haozhan, 2024. "Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
  • Handle: RePEc:eee:chsofr:v:180:y:2024:i:c:s0960077924000365
    DOI: 10.1016/j.chaos.2024.114485
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077924000365
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2024.114485?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. Ai, Jun & He, Tao & Su, Zhan & Shang, Lihui, 2022. "Identifying influential nodes in complex networks based on spreading probability," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. Wen, Xing-Zhang & Zheng, Yue & Du, Wen-Li & Ren, Zhuo-Ming, 2023. "Regulating clustering and assortativity affects node centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    3. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    4. Xu, Guiqiong & Meng, Lei, 2023. "A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    5. 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.
    6. Ni, Xuelian & Xiong, Fei & Pan, Shirui & Chen, Hongshu & Wu, Jia & Wang, Liang, 2023. "How heterogeneous social influence acts on human decision-making in online social networks," Chaos, Solitons & Fractals, Elsevier, vol. 172(C).
    7. Fink, Christian G. & Fullin, Kelly & Gutierrez, Guillermo & Omodt, Nathan & Zinnecker, Sydney & Sprint, Gina & McCulloch, Sean, 2023. "A centrality measure for quantifying spread on weighted, directed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    8. Li, Qian & Zhou, Tao & Lü, Linyuan & Chen, Duanbing, 2014. "Identifying influential spreaders by weighted LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 47-55.
    9. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    10. Alexandre Bovet & Hernán A. Makse, 2019. "Influence of fake news in Twitter during the 2016 US presidential election," Nature Communications, Nature, vol. 10(1), pages 1-14, December.
    11. Li, Zhitao & Tang, Jinjun & Zhao, Chuyun & Gao, Fan, 2023. "Improved centrality measure based on the adapted PageRank algorithm for urban transportation multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    12. Qu, Junyi & Tang, Ming & Liu, Ying & Guan, Shuguang, 2020. "Identifying influential spreaders in reversible process," Chaos, Solitons & Fractals, Elsevier, vol. 140(C).
    13. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    14. Yin, Fulian & Xia, Xinyu & Zhang, Xiaojian & Zhang, Mingjia & Lv, Jiahui & Wu, Jianhong, 2021. "Modelling the dynamic emotional information propagation and guiding the public sentiment in the Chinese Sina-microblog," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    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. Yin, Haofei & Zhang, Aobo & Zeng, An, 2023. "Identifying hidden target nodes for spreading in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    2. Liu, Ying & Tang, Ming & Zhou, Tao & Do, Younghae, 2016. "Identify influential spreaders in complex networks, the role of neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 289-298.
    3. Liu, Honglu & Tian, Zhihong & Huang, Anqiang & Yang, Zaili, 2018. "Analysis of vulnerabilities in maritime supply chains," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 475-484.
    4. Guo, Haoming & Wang, Shuangling & Yan, Xuefeng & Zhang, Kecheng, 2024. "Node importance evaluation method of complex network based on the fusion gravity model," Chaos, Solitons & Fractals, Elsevier, vol. 183(C).
    5. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    6. Ai, Jun & He, Tao & Su, Zhan & Shang, Lihui, 2022. "Identifying influential nodes in complex networks based on spreading probability," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    7. 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.
    8. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    9. Xu, Shuang & Wang, Pei, 2017. "Identifying important nodes by adaptive LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 654-664.
    10. Xiaojian Ma & Yinghong Ma, 2019. "The Local Triangle Structure Centrality Method to Rank Nodes in Networks," Complexity, Hindawi, vol. 2019, pages 1-16, January.
    11. Lv, Zhiwei & Zhao, Nan & Xiong, Fei & Chen, Nan, 2019. "A novel measure of identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 488-497.
    12. Zhu, Canshi & Wang, Xiaoyang & Zhu, Lin, 2017. "A novel method of evaluating key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 96(C), pages 43-50.
    13. Yin, Rongrong & Li, Linhui & Wang, Yumeng & Lang, Chun & Hao, Zhenyang & Zhang, Le, 2024. "Identifying critical nodes in complex networks based on distance Laplacian energy," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).
    14. Sheng, Jinfang & Dai, Jinying & Wang, Bin & Duan, Guihua & Long, Jun & Zhang, Junkai & Guan, Kerong & Hu, Sheng & Chen, Long & Guan, Wanghao, 2020. "Identifying influential nodes in complex networks based on global and local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 541(C).
    15. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    16. 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.
    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. Wang, Zhi-Yong & Zhang, Cui-Ping & Othman Yahya, Rebaz, 2024. "High-quality community detection in complex networks based on node influence analysis," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    19. Xu, Guiqiong & Meng, Lei, 2023. "A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    20. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).

    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:chsofr:v:180:y:2024:i:c:s0960077924000365. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.