Skip to main content

Identifying Vital Nodes in Hypernetworks Based on Improved PageRank Algorithm and Information Entropy

  • Conference paper
  • First Online:
Proceedings of International Conference on Image, Vision and Intelligent Systems 2023 (ICIVIS 2023) (ICIVIS 2023)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bell, D.C., Atkinson, J.S., Carlson, J.W.: Centrality measures for disease transmission networks. Social Netw. 21, 1–21 (1999)

    Article  Google Scholar 

  2. 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)

    Google Scholar 

  3. Liu, C., et al.: Computational network biology: data, models, and applications. Phys. Rep. 846, 1–66 (2020)

    Article  MathSciNet  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Tudisco, F., Higham, D. J.: Node and edge nonlinear eigenvector centrality for hypergraphs. Communications Physics 4(1), 201 (2021)

    Google Scholar 

  8. Guo, J.L., Zhu, X.Y.: The emergence of scalar laws in hyper networks. Acta Physica Sinica 06, 55–61 (2014)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Li, F., Xu, H., Wei, L., Wang, D.: Identifying vital nodes in hypernetwork based on local centrality. J. Combinatorial Optim. 45(1), 32 (2023)

    Google Scholar 

  15. 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)

    Google Scholar 

  16. Subgraph centrality and clustering in complex hyper-networks: Estrada, E., Rodr’iguez-Vel’azquez, J. A. Physica A 364, 581–594 (2006)

    MathSciNet  Google Scholar 

  17. Berge, C.: Graphs and Hypergraph. Elsevier, New York (1976)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Newman, Mark E. J.: A measure of betweenness centrality based on random walks. Social Netw. B27(1), 39–54(2005)

    Google Scholar 

  20. Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nature Physics 6(11), 888–893 (2010).

    Google Scholar 

  21. 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)

    Article  Google Scholar 

  22. Bae, J., Kim, S.: Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A 395, 549–559 (2014)

    Article  MathSciNet  Google Scholar 

  23. 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)

    Google Scholar 

  24. Field, A.P.: Kendall’s coefficient of concordance. Encycl. Stat. Behav. Sci. 2, 1010–1011 (2005)

    Google Scholar 

  25. Müller, B., Reinhardt, J., Strickland, M.T.: Neural networks: an introduction. Springer Science and Business Media (1995)

    Google Scholar 

  26. Albert, R., Barabási, A. L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47(2002)

    Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Faxu Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics