Abstract
Hypernetworks can reflect the multiple connections of entities in the real-world from multiple dimensions. Identifying the vital nodes in hypernetworks is beneficial to analyze the topology and network functions of the hypernetwork. Traditional methods of vital node identification within a hypernetwork struggles to reach an optimum between time complexity and the precision of identification. As a result, this paper proposes a global and local centrality based on the improved PageRank algorithm and information entropy, which merges the local properties of nodes with their global properties to balance accuracy and time complexity. It is then compared with other methods on real hypernetworks in four different domains by means of monotonicity as well as SI propagation model evaluation criteria. To compare the ranking differentiation and accuracy with other centrality algorithms, we perform numerical simulation experiments on four real networks using the SI model. The experimental findings demonstrate that the proposed method not only yields more precise ranking outcomes but also significantly diminishes the occurrence of identical ranking nodes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bell, D.C., Atkinson, J.S., Carlson, J.W.: Centrality measures for disease transmission networks. Social Netw. 21, 1–21 (1999)
Zeng, Q., Liu, Y., Tang, M., Gong,J.: Identifying super-spreaders in information–epidemic coevolving dynamics on multiplex networks .Knowl.-Based Syst. 229, 107365 (2021)
Liu, C., et al.: Computational network biology: data, models, and applications. Phys. Rep. 846, 1–66 (2020)
Aghdam, S.M., Navimipour, N.J.: Opinion leaders selection in the social networks based on trust relationships propagation. Karbala Int. J. Modern Sci. 2(2), 88–97 (2016)
Ilyas, Muhammad U., Radha, Hayder.: Identifying influential nodes in online social networks using principal component centrality. In: 2011 IEEE International Conference on Communications (ICC), pp. 1–5, Institute of Electrical and Electronics Engineers, New York (2011)
Kapoor, K., Sharma, D., Srivastava, J.: Weighted node degree centrality for hypergraphs. In: 2013 IEEE 2nd Network Science Workshop (NSW), pp. 152–155. Institute of Electrical and Electronics Engineers, New York (2013)
Tudisco, F., Higham, D. J.: Node and edge nonlinear eigenvector centrality for hypergraphs. Communications Physics 4(1), 201 (2021)
Guo, J.L., Zhu, X.Y.: The emergence of scalar laws in hyper networks. Acta Physica Sinica 06, 55–61 (2014)
Zhou, L.N., Li, F.X., Gong, Y.C., Hu, F.: Identification methons of vital nodes based on k-shell in hypernetworks. Complex Syst. Complex. Sci. 18, 15–22 (2021)
Wu, Y. H., Tian, K., Li, M. D., Hu, F.: Important node recognition in hypernetworks based on node propagation entropy. Comput. Eng. Appl. 59(19), 1–11 (2023)
Xie, X., Zhan, X., Zhang, Z., Liu, C.: Vital node identification in hypergraphs via gravity model. Chaos: Interdiscip. J. Nonlinear Sci. 33(1), 013104 (2023)
Shan, E.F., Cai, L., Zeng, H., Peng, C.J.: The υ-position value measure on centrality of hypernetworks. Oper. Res. Manage. Sci. 29(5), 135–142 (2020)
Gao, J., Zhang, K., Hu, W.J., Ding, X.X.: Evaluation method of key nodes in hypernetwork based on contribution matrix. Electron. Design Eng. 7, 10–15 (2023)
Li, F., Xu, H., Wei, L., Wang, D.: Identifying vital nodes in hypernetwork based on local centrality. J. Combinatorial Optim. 45(1), 32 (2023)
Liu, C., Wang, J., Xia, R.: Node importance evaluation in multi-platform avionics architecture based on TOPSIS and PageRank. EURASIP J. Adv. Signal Process. 2023(1), 27 (2023)
Subgraph centrality and clustering in complex hyper-networks: Estrada, E., Rodr’iguez-Vel’azquez, J. A. Physica A 364, 581–594 (2006)
Berge, C.: Graphs and Hypergraph. Elsevier, New York (1976)
Hu, F., Liu, M., Zhao, J.: Analysis and application of topological properties of protein complex hypernetworks. Complex Syst. Complexity Sci. 15(4), 31–38 (2018)
Newman, Mark E. J.: A measure of betweenness centrality based on random walks. Social Netw. B27(1), 39–54(2005)
Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nature Physics 6(11), 888–893 (2010).
Yang, Y., Wang, X., Chen, Y., Hu, M., Ruan, C.: A novel centrality of influential nodes identification in complex networks. IEEE access 8, 58742–58751 (2020)
Bae, J., Kim, S.: Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395, 549–559 (2014)
Yang, Y. Z., Hu, M., Huang, T. Y.: Influential nodes identification in complex networks based on global and local information. Chin. Phys. B 29(8), 088903 (2020)
Field, A.P.: Kendall’s coefficient of concordance. Encycl. Stat. Behav. Sci. 2, 1010–1011 (2005)
Müller, B., Reinhardt, J., Strickland, M.T.: Neural networks: an introduction. Springer Science and Business Media (1995)
Albert, R., Barabási, A. L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47(2002)
Acknowledgements
This work was supported by the Major Achievements Transformation Project from Qinghai Province(Nos. 2020-SF-139), the State Key Laboratory of Tibetan Intelligent Information Pro-cessing and Application, the Key Laboratory of Tibetan Intelligent Information Processing and Machine Translation of Qinghai P.R.C and the Key Laboratory of Tibetan Information Processing of Ministry of Education P.R.C.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Chen, J., Wei, L., Li, P., Ding, H., Li, F., Wang, D. (2024). Identifying Vital Nodes in Hypernetworks Based on Improved PageRank Algorithm and Information Entropy. In: You, P., Liu, S., Wang, J. (eds) Proceedings of International Conference on Image, Vision and Intelligent Systems 2023 (ICIVIS 2023). ICIVIS 2023. Lecture Notes in Electrical Engineering, vol 1163. Springer, Singapore. https://doi.org/10.1007/978-981-97-0855-0_63
Download citation
DOI: https://doi.org/10.1007/978-981-97-0855-0_63
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0854-3
Online ISBN: 978-981-97-0855-0
eBook Packages: EngineeringEngineering (R0)