Identifying important nodes of hypergraph: An improved PageRank algorithm
Yu-Hao Piao(朴宇豪)1, Jun-Yi Wang(王俊义)2, and Ke-Zan Li(李科赞)1,3,†
1 School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China; 2 School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China; 3 Guangxi Wireless Broadband Communication and Signal Processing Key Laboratory, Guilin University of Electronic Technology, Guilin 541004, China
Abstract Hypergraphs can accurately capture complex higher-order relationships, but it is challenging to identify their important nodes. In this paper, an improved PageRank (ImPageRank) algorithm is designed to identify important nodes in a directed hypergraph. The algorithm introduces the Jaccard similarity of directed hypergraphs. By comparing the numbers of common neighbors between nodes with the total number of their neighbors, the Jaccard similarity measure takes into account the similarity between nodes that are not directly connected, and can reflect the potential correlation between nodes. An improved susceptible-infected (SI) model in directed hypergraph is proposed, which considers nonlinear propagation mode and more realistic propagation mechanism. In addition, some important node evaluation methods are transferred from undirected hypergraphs and applied to directed hypergraphs. Finally, the ImPageRank algorithm is used to evaluate the performance of the SI model, network robustness and monotonicity. Simulations of real networks demonstrate the excellent performance of the proposed algorithm and provide a powerful framework for identifying important nodes in directed hypergraphs.
Received: 06 December 2024
Revised: 12 January 2025
Accepted manuscript online: 05 February 2025
PACS:
89.75.-k
(Complex systems)
Fund: Project supported by the National Natural Science Foundation of China (Grant No. 62166010) and the Guangxi Natural Science Foundation (Grant No. 2023GXNSFAA026087).
Corresponding Authors:
Ke-Zan Li
E-mail: lkzzr@guet.edu.cn
Cite this article:
Yu-Hao Piao(朴宇豪), Jun-Yi Wang(王俊义), and Ke-Zan Li(李科赞) Identifying important nodes of hypergraph: An improved PageRank algorithm 2025 Chin. Phys. B 34 048902
[1] Bell D C, Atkinson J S and Carlson J W 1999 Soc. Networks 21 1 [2] Zeng Q, Liu Y, Tang M and Gong J 2021 Knowl. Based. Syst. 229 107365 [3] Liu C, Ma Y, Zhao J, Nussinov R, Zhang Y C, Cheng F and Zhang Z K 2020 Phys. Rep. 846 1 [4] Aghdam S M and Navimipour N J 2016 Karbala International Journal of Modern Science 2 88 [5] Shah D and Zaman T 2011 IEEE. T. Inform. Theory 57 5163 [6] AskarizadehMand Ladani B T 2021 Eng. Appl. Artif. Intel 100 104198 [7] Mochalova A and Nanopoulos A 2014 Electron. Commer. R. A 13 283 [8] Du Y, Gao C, Hu Y, Mahadevan S and Deng Y 2014 Phys. A 399 57 [9] Strogatz S H 2001 Nature 410 268 [10] Hofmann S G, Curtiss J and McNally R J 2016 Psychol. Sci 11 597 [11] Gao Z K, Small M and Kurths J 2017 Epl-Europhys. Lett. 116 50001 [12] Ruan Y, Tang J, Hu Y, Wang H and Bai L 2020 IEEE Access 8 28947 [13] Jiang L, Jing Y, Hu S, Ge B and Xiao W 2018 Appl. Sci. 8 1914 [14] Xu S and Wang P 2017 Phys. A 469 654 [15] Hu F and Liu Y 2015 Mod. Phys. Lett. B 29 1450268 [16] Wang T, Chen S, Wang X and Wang J 2020 Physica. A 551 124137 [17] Tang P, Song C, Ding W, Ma J, Dong J and Huang L 2020 Entropy 22 364 [18] Van Dolen W M, Dabholkar P A and De Ruyter K 2007 J. Retail 83 339 [19] Lung R I, Gaskó N and Suciu M A 2018 Scientometrics 117 1361 [20] Rafferty J, Watkins A, Lyons J, Lyons R A, Akbari A, Peek N, Jalali-Najafabadi F, Dhafari T B, Pate A and Martin G P 2021 J. Biomed Inform. 122 103916 [21] Hu F, Tian K and Zhang Z K 2023 Entropy 25 1263 [22] Képes T Z 2023 PeerJ Comput. Sci. 9 e1351 [23] Benson A R 2019 SIAM Journal on Mathematics of Data Science 1 293 [24] Kamvar S, Haveliwala T and Golub G 2004 Linear Algebra Appl. 386 51 [25] Zheng W, Mo S, Duan P and Jin X 2017 3rd IEEE International Conference on Control Science and Systems Engineering (ICCSSE) p. 615-618 [26] Hasan F, Ze K K, Razali R, Buhari A and Tadiwa E 2020 Science Proceedings Series 2 17 [27] Rani R and Jain V 2013 Int. J. Sci. Res. Pub. 3 1 [28] Haveliwala T H 2002 Proceedings of the 11th international conference on World Wide Web pp. 517-526 [29] Tran L, Quan T and Mai A 2019 arXiv:1909.01132cs.SI] [30] Li K, Lin Y and Wang J 2024 Chaos Solitons Fractals 184 115000 [31] Cohen I, Huang Y, Chen J, Benesty J, Benesty J, Chen J, Huang Y and Cohen I 2009 Noise Reduction in Speech Processing 1 [32] Hu F, Tian K and Zhang Z 2019 Entropy 25 1263 [33] Luo X, Peng J and Liang J 2022 IET Intelligent Transport Systems 16 85 [34] Ducournau A and Bretto A 2014 Computer Vision and Image Understanding 120 91 [35] Xie X, Zhan X, Zhang Z and Liu C 2023 Chaos 33 1 [36] Al-Ghour S and Al-Saadi H 2024 Aims. Math. 9 1562 [37] Battiston F, Cencetti G, Iacopini I, Latora V, Lucas M, Patania A, Young J G and Petri G 2020 Phys. Rep. 874 1 [38] Aksoy S G, Joslyn C, Marrero C O, Praggastis B and Purvine E 2020 EPJ. Data. Sci. 9 16 [39] Dode A and Hasani S 2017 IOSR J. Comput. 19 01 [40] Huling J D, Greifer N and Chen G 2024 J. Am. Stat. Assoc 119 1657 [41] Ren X L, Gleinig N, Helbing D and Antulov-Fantulin N 2019 Proc. Natl. Acad. Sci. USA 116 6554 [42] Lu P, Lan J, Tang J, Zhang L, Song S and Zhu H 2023 Chin. Phys. B 33 018901 [43] Lu P, Zhong Y and Yang P 2023 Chin. Phys. B 33 018903 [44] Yan Z, Xia Y, Guo L, Zhu L, Liang Y and Tu H 2023 Chin. Phys. B 32 068901 [45] Ye Q, Yan G, Chang W and Luo H 2023 Eur. Phys. J. B 96 15 [46] Ullah A, Wang B, Sheng J, Long J, Khan N and Sun Z 2021 Expert Syst. Appl 186 115778 [47] Da Ai et al. 2023 Chin. Phys. B 32 118902 [48] Song J H 2023 Chin. Phys. B 32 098901
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
