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

A novel semi local measure of identifying influential nodes in complex networks

Author

Listed:
  • Wang, Xiaojie
  • Slamu, Wushour
  • Guo, Wenqiang
  • Wang, Sixiu
  • Ren, Yan

Abstract

How to identify influencers is very significance in mastering the nature of node, controlling spreading process in complex networks. In this research field, each method has its own advantages and limitations. For example, local metrics are relatively simple, global metrics can give better results, but the computational complexity is also relatively high. A semi-local approach on basis of node dimension is proposed to identify influencers. The node dimension can detect regions with different dimensional structures by scaling the local dimension on the scale. The saturation effect is discovered in the process of identifying influencers by the node dimension. When the maximum dimension radius is close to the mean shortest path length of networks, the method has better performance. Through the saturation effect, our approach can be a tradeoff between local and global metrics. In addition, we show the correlation between different measures and node dimension with different maximum dimension radii. We employ Susceptible-Infected-Recovered (SIR) model to verify the effectiveness of our designed approach. Simulation results indicate the superiority of our algorithm.

Suggested Citation

  • Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    • Handle: RePEc:eee:chsofr:v:158:y:2022:i:c:s0960077922002478
    DOI: 10.1016/j.chaos.2022.112037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077922002478
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2022.112037?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. Gupta, Naveen & Singh, Anurag & Cherifi, Hocine, 2016. "Centrality measures for networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 46-59.
    2. Costa, Luciano da Fontoura & Rodrigues Tognetti, Marilza A. & Silva, Filipi Nascimento, 2008. "Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6201-6214.
    3. M. T. Gastner & M. E.J. Newman, 2006. "The spatial structure of networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 49(2), pages 247-252, January.
    4. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    5. Fei, Liguo & Zhang, Qi & Deng, Yong, 2018. "Identifying influential nodes in complex networks based on the inverse-square law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1044-1059.
    6. Zareie, Ahmad & Sheikhahmadi, Amir & Fatemi, Adel, 2017. "Influential nodes ranking in complex networks: An entropy-based approach," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 485-494.
    7. Bae, Joonhyun & Kim, Sangwook, 2014. "Identifying and ranking influential spreaders in complex networks by neighborhood coreness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 549-559.
    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. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    2. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    3. Wu, Zhenxing & Lu, Xi & Deng, Yong, 2015. "Image edge detection based on local dimension: A complex networks approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 440(C), pages 9-18.
    4. Malang, Kanokwan & Wang, Shuliang & Phaphuangwittayakul, Aniwat & Lv, Yuanyuan & Yuan, Hanning & Zhang, Xiuzhen, 2020. "Identifying influential nodes of global terrorism network: A comparison for skeleton network extraction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    5. Robert Peach & Alexis Arnaudon & Mauricio Barahona, 2022. "Relative, local and global dimension in complex networks," Nature Communications, Nature, vol. 13(1), pages 1-11, December.
    6. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
    7. 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).
    8. Ibnoulouafi, Ahmed & El Haziti, Mohamed, 2018. "Density centrality: identifying influential nodes based on area density formula," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 69-80.
    9. Ahmad, Amreen & Ahmad, Tanvir & Bhatt, Abhishek, 2020. "HWSMCB: A community-based hybrid approach for identifying influential nodes in the social network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    10. Saxena, Chandni & Doja, M.N. & Ahmad, Tanvir, 2020. "Entropy based flow transfer for influence dissemination in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    11. Wei, Bo & Deng, Yong, 2019. "A cluster-growing dimension of complex networks: From the view of node closeness centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 80-87.
    12. 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).
    13. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    14. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    15. 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.
    16. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    17. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    18. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    19. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    20. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(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:158:y:2022:i:c:s0960077922002478. 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.