|
Special Issue:
SPECIAL TOPIC — Computational programs in complex systems
|
| SPECIAL TOPIC — Computational programs in complex systems |
Prev
Next
|
|
|
Identification of vital nodes based on global and local features in hypergraphs |
| Li Liang(梁丽), Li-Yao Qi(齐丽瑶), and Shi-Cai Gong(龚世才)† |
| School of Science, Zhejiang University of Science and Technology, Hangzhou 310023, China |
|
|
|
|
Abstract Hypergraphs, which encapsulate interactions of higher-order beyond mere pairwise connections, are essential for representing polyadic relationships within complex systems. Consequently, an increasing number of researchers are focusing on the centrality problem in hypergraphs. Specifically, researchers are tackling the challenge of utilizing higher-order structures to effectively define centrality metrics. This paper presents a novel approach, LGK, derived from the K-shell decomposition method, which incorporates both global and local perspectives. Empirical evaluations indicate that the LGK method provides several advantages, including reduced time complexity and improved accuracy in identifying critical nodes in hypergraphs.
|
Received: 24 June 2025
Revised: 04 August 2025
Accepted manuscript online: 26 August 2025
|
|
PACS:
|
89.75.-k
|
(Complex systems)
|
| |
89.75.Fb
|
(Structures and organization in complex systems)
|
| |
05.45.-a
|
(Nonlinear dynamics and chaos)
|
|
Corresponding Authors:
Shi-Cai Gong
E-mail: gongsc@zust.edu.cn
|
Cite this article:
Li Liang(梁丽), Li-Yao Qi(齐丽瑶), and Shi-Cai Gong(龚世才) Identification of vital nodes based on global and local features in hypergraphs 2025 Chin. Phys. B 34 108904
|
[1] Strogatz S 2001 Nature 410 268
[2] Dorogovtsev S N, Goltsev A V and Mendes J F F 2008 Rev. Mod. Phys. 80 1275
[3] Newman M E J 2003 SIAM Review 45 167
[4] Cohen R, Havlin S and ben-Avraham D 2002 Handbook of Graphs and Networks: From the Genome to the Internet pp. 85-110
[5] Benson A R, Gleich D F and Leskovec J 2016 Science 353 163
[6] Lawyer G 2015 Scientific Reports 5 8665
[7] Pastor-Satorras R, Castellano C, Van Mieghem P and Vespignani A 2015 Rev. Mod. Phys. 87 925
[8] Restrepo J G, Ott E and Hunt B R 2006 Phys. Rev. Lett. 97 094102
[9] Liu J, Xiong Q Y, Shi W R, Shi X and Wang K 2016 Physica A 452 209
[10] Hu P, Fan W L and Mei S W 2015 Physica A 429 169
[11] Yang Y Y and Xie G 2016 Information Processing & Management 52 911
[12] Shah D and Zaman T 2011 IEEE Transactions on Information Theory 57 5163
[13] Bell D C, Atkinson J S and Carlson J W 1999 Social Networks 21 1
[14] Radicchi F, Fortunato S, Markines B and Vespignani A 2009 Phys. Rev. E 80 056103
[15] Albert R, Jeong H and Barabási A L 2000 Nature 406 378
[16] Motter A E and Lai Y C 2002 Phys. Rev.E 66 065102
[17] Cohen R, Havlin S and Ben-Avraham D 2003 Phys. Rev. Lett. 91 247901
[18] Clement C B, Bierbaum M, O’Keeffe K P and Alemi A A 2019 arXiv:1905.00075
[19] Ruepp A, Waegele B, Lechner M, Brauner B, Dunger-Kaltenbach I, Fobo G, Frishman G, Montrone C and Mewes H W 2010 Nucleic Acids Research 38(suppl 1) D497
[20] Mastrandrea R, Fournet J and Barrat A 2015 PloS One 109 e0136497
[21] Kapoor K, Sharma D and Srivastava J 2013 2013 IEEE 2nd network science workshop (NSW) 152
[22] Vogiatzis C, Veremyev A, Pasiliao E L and Pardalos P M 2015 Optimization Letters 9 615
[23] Benson A R 2019 SIAM Journal on Mathematics of Data Science 12 293
[24] Kovalenko K, Romance M, Vasilyeva E, Aleja D, Criado R, Musatov D, Raigorodskii A M, Flores J, Samoylenko I and Alfaro-Bittner K 2022 Chaos, Solitons & Fractals 162 112397
[25] Zeng Y J, Huang Y M, Ren X L and Lü L Y 2024 Information Sciences 679 121067
[26] Piao Y H, Wang J Y and Li K Z 2025 Chin. Phys. B 34 048902
[27] Hu F, Liu M, Zhao J and Lei L 2019 Complex Systems and Complexity Science 15 31
[28] Estrada E and Rodríguez-Velázquez J A 2006 Physica A 364 581
[29] Zhou L N, Li F X, Gong Y C and Hu F 2021 Complex Systems and Complexity Science 18 15
[30] Wu Y H, Li M D and Hu F 2023 Complex Systems and Complexity Science 20 40
[31] Xie X W, Zhan X X, Zhang Z K and Liu C 2023 Chaos 331
[32] Wang P, Ling G, Zhao P, Pan W Q and Ge M-F 2024 Chaos, Solitons & Fractals 188 115503
[33] Guo L, Liu W, Zhang X and Hu F 2025 International Conference on Computer Application and Information Security 13562 546
[34] Wang W, Nie Y Y, Li W Y, Lin T, Shang M S, Su S, Tang Y, Zhang Y C and Sun G Q 2024 Physics Reports 1056 1
[35] Suo Q, Guo J L and Sen A Z 2018 Physica A 495 475
[36] Landry N W and Restrepo J G 2020 Physica A 30 10
[37] Ran Y J, Deng X M, Wang X M and Jia T 2020 Chaos 30 8
[38] Nie Y Y, Zhong X N, Lin T and Wang W 2022 Applied Mathematics and Computation 432 127380
[39] St-Onge G, Iacopini I, Latora V, Barrat A, Petri G, Allard A and Hébert-Dufresne L 2022 Communications Physics 5 25
[40] Zhang Z Y, Mei X H, Jiang H J, Luo X P and Xia Y 2023 Applied Mathematics and Computation 446 127887
[41] Cui S X, Liu F Z, Liang L D, Jardón-Kojakhmetov H and Cao M 2025 Automatica 177
[42] Zhou Y, Liu Y P, Yuan L, Zhuo Y H, Xu K S, Wu J and Zheng M H 2025 Chin. Phys. B 34 038704
[43] Berge C 1973 A Survey of Combinatorial Theory 20 15
[44] Bretto A 2013 Hypergraph Theory An introduction (Cham: Springer) pp. 209-216
[45] Aksoy S G, Joslyn C, Marrero C O, Praggastis B and Purvine E 2020 EPJ Data Science 91 16
[46] Kitsak M, Gallos L K, Havlin S, Liljeros F, Muchnik L, Stanley H E and Makse H A 2010 Nat. Phys. 6 888
[47] Chodrow P S, Veldt N and Benson A R 2021 Science Advances 7 eabh1303
[48] Amburg I, Veldt N and Benson A R 2020 arXiv:2006.05645
[49] Ni J, Li J and McAuley J 2019 Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing 188
[50] Cohen I, Huang Y, Chen J D, Benesty J, Huang Y T and Cohen I 2009 Noise reduction in speech processing 1
[51] Zhou F, Lü L Y, Liu JG and MarianiMS 2024 National Science Review 11 nwae073 |
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
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.
View more on Altmetrics
|
|
|
