Author
Listed:
- Wu, Tingting
- Fu, Qinghua
- Xie, Wei
Abstract
Due to the significant heterogeneity inherent in complex networks, only a small fraction of nodes plays critical roles in governing network functionality and dynamics. Identifying key nodes in such networks is therefore a fundamental challenge, with wide-ranging applications in information diffusion, network dynamics analysis, and epidemic control. Traditional centrality-based metrics typically quantify node importance based on a single topological feature, while recent advances still struggle to effectively capture the combined influence of nodes across multiple structural scales. To address these limitations, this paper proposes a Gravity-Inspired Hierarchical Centrality (GIHC) metric for key node identification in complex networks. This metric quantifies the importance of nodes based on spreading efficiency, taking into account time spreading and temporal constraints. Leveraging the high structural awareness of shortest-path-based and semi-local neighborhood indices, GIHC uniquely integrates the influence of semi-local connections into the estimation of node importance. Inspired by the law of gravity, the GIHC models node interactions as gravitational forces, enabling a more accurate reflection of structural influence within the network. Furthermore, GIHC incorporates global hierarchical information alongside semi-local neighborhood propagation capabilities, forming a hybrid centrality metric that captures both hierarchical organization and mesoscopic influence patterns. Extensive experiments conducted on real-world networks demonstrate that GIHC achieves improved scalability and enhanced ranking accuracy compared to existing centrality metrics. Moreover, GIHC consistently outperforms competing algorithms in epidemic spreading simulations and ranking consistency evaluations, effectively capturing the hierarchical semi-local spreading capabilities of key nodes.
Suggested Citation
Wu, Tingting & Fu, Qinghua & Xie, Wei, 2026.
"A gravity-inspired hierarchical approach considering time spreading for key node identification in complex networks,"
Chaos, Solitons & Fractals, Elsevier, vol. 208(P2).
Handle:
RePEc:eee:chsofr:v:208:y:2026:i:p2:s0960077926003164
DOI: 10.1016/j.chaos.2026.118175
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:208:y:2026:i:p2:s0960077926003164. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.