中国物理B ›› 2025, Vol. 34 ›› Issue (2): 28901-028901.doi: 10.1088/1674-1056/ad9a9b

• • 上一篇    下一篇

Node ranking based on graph curvature and PageRank

Hongbo Qu(曲鸿博)1, Yu-Rong Song(宋玉蓉)2,†, Ruqi Li(李汝琦)1, Min Li(李敏)2, and Guo-Ping Jiang(蒋国平)2   

  1. 1 School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China;
    2 College of Automation & College of Artificial Intelligence, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
  • 收稿日期:2024-09-30 修回日期:2024-11-16 接受日期:2024-12-05 出版日期:2025-02-15 发布日期:2025-01-15
  • 通讯作者: Yu-Rong Song E-mail:songyr@njupt.edu.cn
  • 基金资助:
    Project partially supported by the National Natural Science Foundation of China (Grant Nos. 61672298 and 62373197), the Major Project of Philosophy and Social Science Research in Colleges and Universities in Jiangsu Province, China (Grant No. 2018SJZDI142), and the Postgraduate Research & Practice Innovation Program of Jiangsu Province, China (Grant No. KYCX23 1045).

Node ranking based on graph curvature and PageRank

Hongbo Qu(曲鸿博)1, Yu-Rong Song(宋玉蓉)2,†, Ruqi Li(李汝琦)1, Min Li(李敏)2, and Guo-Ping Jiang(蒋国平)2   

  1. 1 School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China;
    2 College of Automation & College of Artificial Intelligence, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
  • Received:2024-09-30 Revised:2024-11-16 Accepted:2024-12-05 Online:2025-02-15 Published:2025-01-15
  • Contact: Yu-Rong Song E-mail:songyr@njupt.edu.cn
  • Supported by:
    Project partially supported by the National Natural Science Foundation of China (Grant Nos. 61672298 and 62373197), the Major Project of Philosophy and Social Science Research in Colleges and Universities in Jiangsu Province, China (Grant No. 2018SJZDI142), and the Postgraduate Research & Practice Innovation Program of Jiangsu Province, China (Grant No. KYCX23 1045).

摘要: Identifying key nodes in complex networks is crucial for understanding and controlling their dynamics. Traditional centrality measures often fall short in capturing the multifaceted roles of nodes within these networks. The PageRank algorithm, widely recognized for ranking web pages, offers a more nuanced approach by considering the importance of connected nodes. However, existing methods generally overlook the geometric properties of networks, which can provide additional insights into their structure and functionality. In this paper, we propose a novel method named Curv-PageRank (C-PR), which integrates network curvature and PageRank to identify influential nodes in complex networks. By leveraging the geometric insights provided by curvature alongside structural properties, C-PR offers a more comprehensive measure of a node's influence. Our approach is particularly effective in networks with community structures, where it excels at pinpointing bridge nodes critical for maintaining connectivity and facilitating information flow. We validate the effectiveness of C-PR through extensive experiments. The results demonstrate that C-PR outperforms traditional centrality-based and PageRank methods in identifying critical nodes. Our findings offer fresh insights into the structural importance of nodes across diverse network configurations, highlighting the potential of incorporating geometric properties into network analysis.

关键词: important nodes, graph curvature, complex networks, network geometry

Abstract: Identifying key nodes in complex networks is crucial for understanding and controlling their dynamics. Traditional centrality measures often fall short in capturing the multifaceted roles of nodes within these networks. The PageRank algorithm, widely recognized for ranking web pages, offers a more nuanced approach by considering the importance of connected nodes. However, existing methods generally overlook the geometric properties of networks, which can provide additional insights into their structure and functionality. In this paper, we propose a novel method named Curv-PageRank (C-PR), which integrates network curvature and PageRank to identify influential nodes in complex networks. By leveraging the geometric insights provided by curvature alongside structural properties, C-PR offers a more comprehensive measure of a node's influence. Our approach is particularly effective in networks with community structures, where it excels at pinpointing bridge nodes critical for maintaining connectivity and facilitating information flow. We validate the effectiveness of C-PR through extensive experiments. The results demonstrate that C-PR outperforms traditional centrality-based and PageRank methods in identifying critical nodes. Our findings offer fresh insights into the structural importance of nodes across diverse network configurations, highlighting the potential of incorporating geometric properties into network analysis.

Key words: important nodes, graph curvature, complex networks, network geometry

中图分类号:  (Complex systems)

  • 89.75.-k
89.75.Fb (Structures and organization in complex systems) 02.40.-k (Geometry, differential geometry, and topology)