Identifying influential nodes in complex networks based on closeness energy

Jinping Wang and Shaowei Sun

Chaos, Solitons & Fractals, 2025, vol. 200, issue P2

Abstract: Identifying influential nodes in complex network is crucial for understanding the network’s structure and maintaining its stability. In recent years, scholars have designed methods for identifying influential nodes from the perspective of graph energy. However, analysis shows that the method based on distance Laplacian energy is limited by network connectivity. To address the above weaknesses, we propose closeness energy centrality (CEC), which uses the closeness energy of the network before and after node deletion as an evaluation metric. By introducing the closeness matrix, the CEC method expands the applicability of the network. By comparing it with eight traditional methods in four aspects, we verify that the CEC method’s performance is significantly better than that of other methods.

Keywords: Complex network; Influential nodes; Closeness energy; SIR model (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077925010902
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:200:y:2025:i:p2:s0960077925010902

DOI: 10.1016/j.chaos.2025.117077

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().