识别复杂网络中的关键节点是一项基础性挑战，在社交网络分析、通信基础设施、交通系统和信息网络等领域具有广泛应用。现有排序方法通常依赖于度数、k-壳指数及邻域连通性等结构特征的组合来估计节点的重要性。然而，许多此类方法存在若干关键局限性，包括准确性不足、对影响力相近节点的区分能力（分辨率）较低、依赖可调参数，以及计算复杂度高，从而限制了其在大规模或真实网络中的实用性。本研究提出一种新的排序框架，将拟拉普拉斯结构度量与受引力启发的聚合过程相结合。其核心思想是仅利用度数和k-壳指数这两种简单但信息丰富的属性，构建每个节点结构角色的增强表征，并通过短程相互作用机制评估其局部影响力。所提方法无需可调参数、具备可解释性且计算高效，仅需一个固定的小引力半径（R=3），因而适用于大规模且异构的网络。在九个真实网络上开展的实验表明，相较于八种前沿方法，该框架在准确性、分辨率和计算简洁性方面均持续优于现有技术。结果凸显了引力-拟拉普拉斯范式作为识别复杂网络关键节点的一种可靠且可扩展工具的有效性。

Identifying influential nodes in complex networks is a fundamental challenge with broad applications in areas such as social network analysis, communication infrastructure, transportation systems, and information networks. Existing ranking methods typically rely on combinations of structural features-such as degree, k-shell index, and neighborhood connectivity-to estimate a node's importance. However, many of these approaches suffer from key limitations, including insufficient accuracy, low resolution in distinguishing nodes with similar influence, dependence on tunable parameters, and high computational complexity, which restrict their practicality in large-scale or real-world networks. This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process. The core idea is to construct a strengthened representation of each node's structural role using only simple yet informative attributes-namely degree and k-shell index-and then evaluate its local influence through a short-range interaction mechanism. The proposed approach is designed to be free of tunable parameters, interpretable, and computationally efficient, requiring only a small fixed gravity radius (R=3), which makes it suitable for large and diverse networks. Experiments conducted on nine real-world networks and compared against eight state-of-the-art methods demonstrate that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity. These results highlight the effectiveness of the gravity-quasi-Laplacian paradigm as a reliable and scalable tool for identifying influential nodes in complex networks.