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

GNR: A universal and efficient node ranking model for various tasks based on graph neural networks

Author

Listed:
  • Qu, Hongbo
  • Song, Yu-Rong
  • Li, Ruqi
  • Li, Min

Abstract

Node ranking is an essential problem in complex networks, which aims to identify influential or central nodes in a graph. Existing methods for node ranking are either computationally expensive or suboptimal for different networks and multiple tasks. In this paper, we propose GNR, a graph neural network-based node ranking model that can sort nodes quickly and efficiently for any type of networks. To achieve this, GNR takes into account three factors to calculate the importance of nodes and train the model: degree, infection score, and dismantling score, which capture the local and global structure of the network and the effect of nodes on network propagation and dismantling. We conduct extensive experiments on 16 real networks, and compare GNR with other centrality-based node ranking models on three tasks: network dismantling, virus propagation, and information spreading. The results show that GNR performs better in most cases and validates the effectiveness and superiority of our model.

Suggested Citation

  • Qu, Hongbo & Song, Yu-Rong & Li, Ruqi & Li, Min, 2023. "GNR: A universal and efficient node ranking model for various tasks based on graph neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P2).
    • Handle: RePEc:eee:phsmap:v:632:y:2023:i:p2:s0378437123008944
    DOI: 10.1016/j.physa.2023.129339
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437123008944
    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.2023.129339?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. Cooper, Ian & Mondal, Argha & Antonopoulos, Chris G., 2020. "A SIR model assumption for the spread of COVID-19 in different communities," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    2. Zhan, Xiu-Xiu & Liu, Chuang & Zhou, Ge & Zhang, Zi-Ke & Sun, Gui-Quan & Zhu, Jonathan J.H. & Jin, Zhen, 2018. "Coupling dynamics of epidemic spreading and information diffusion on complex networks," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 437-448.
    3. Marco Grassia & Manlio De Domenico & Giuseppe Mangioni, 2021. "Machine learning dismantling and early-warning signals of disintegration in complex systems," Nature Communications, Nature, vol. 12(1), pages 1-10, December.
    4. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    5. Wang, Jia-zeng & Liu, Zeng-rong & Xu, Jianhua, 2007. "Epidemic spreading on uncorrelated heterogenous networks with non-uniform transmission," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 382(2), pages 715-721.
    6. Yang, Jianmei & Yao, Canzhong & Ma, Weicheng & Chen, Guanrong, 2010. "A study of the spreading scheme for viral marketing based on a complex network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(4), pages 859-870.
    7. 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.
    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. Xiaojie Wang & Xue Zhang & Chengli Zhao & Dongyun Yi, 2016. "Maximizing the Spread of Influence via Generalized Degree Discount," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-16, October.
    2. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
    3. 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.
    4. Huang, He & Chen, Yahong & Ma, Yefeng, 2021. "Modeling the competitive diffusions of rumor and knowledge and the impacts on epidemic spreading," Applied Mathematics and Computation, Elsevier, vol. 388(C).
    5. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    6. Yang, Xu-Hua & Xiong, Zhen & Ma, Fangnan & Chen, Xiaoze & Ruan, Zhongyuan & Jiang, Peng & Xu, Xinli, 2021. "Identifying influential spreaders in complex networks based on network embedding and node local centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 573(C).
    7. Bi, Jialin & Jin, Ji & Qu, Cunquan & Zhan, Xiuxiu & Wang, Guanghui & Yan, Guiying, 2021. "Temporal gravity model for important node identification in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).
    8. Duan-Bing Chen & Hui Gao & Linyuan Lü & Tao Zhou, 2013. "Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    9. 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).
    10. Mohamed M. Mousa & Fahad Alsharari, 2021. "A Comparative Numerical Study and Stability Analysis for a Fractional-Order SIR Model of Childhood Diseases," Mathematics, MDPI, vol. 9(22), pages 1-12, November.
    11. Yin, Fulian & Jiang, Xinyi & Qian, Xiqing & Xia, Xinyu & Pan, Yanyan & Wu, Jianhong, 2022. "Modeling and quantifying the influence of rumor and counter-rumor on information propagation dynamics," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    12. Xing Tang & Qiguang Miao & Shangshang Yu & Yining Quan, 2016. "A Data-Based Approach to Discovering Multi-Topic Influential Leaders," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-14, July.
    13. Luo, Mengzhuo & Liu, Xinzhi & Zhong, Shouming & Cheng, Jun, 2018. "Synchronization of multi-stochastic-link complex networks via aperiodically intermittent control with two different switched periods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 20-38.
    14. Talal Daghriri & Michael Proctor & Sarah Matthews, 2022. "Evolution of Select Epidemiological Modeling and the Rise of Population Sentiment Analysis: A Literature Review and COVID-19 Sentiment Illustration," IJERPH, MDPI, vol. 19(6), pages 1-20, March.
    15. Sheng Bin, 2023. "Social Network Emotional Marketing Influence Model of Consumers’ Purchase Behavior," Sustainability, MDPI, vol. 15(6), pages 1-17, March.
    16. Cooper, Ian & Mondal, Argha & Antonopoulos, Chris G., 2020. "Dynamic tracking with model-based forecasting for the spread of the COVID-19 pandemic," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    17. Zhu, Yu-Xiao & Cao, Yan-Yan & Chen, Ting & Qiu, Xiao-Yan & Wang, Wei & Hou, Rui, 2018. "Crossover phenomena in growth pattern of social contagions with restricted contact," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 408-414.
    18. Lin William Cong & Ke Tang & Bing Wang & Jingyuan Wang, 2021. "An AI-assisted Economic Model of Endogenous Mobility and Infectious Diseases: The Case of COVID-19 in the United States," Papers 2109.10009, arXiv.org.
    19. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    20. Ghanbari, Behzad, 2021. "On detecting chaos in a prey-predator model with prey’s counter-attack on juvenile predators," Chaos, Solitons & Fractals, Elsevier, vol. 150(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:phsmap:v:632:y:2023:i:p2:s0378437123008944. 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.