Strategic node identification in complex network dynamics

Elaheh Nikougoftar

Chaos, Solitons & Fractals, 2024, vol. 187, issue C

Abstract: Detecting significant nodes in intricate networks is essential for various purposes, including market advertising, rumor management, and predicting scientific publications. Existing algorithms, from basic degree methods to more complex approaches, have been developed, but there is a need for a more robust solution. Traditional methods often focus on local network details, neglecting global aspects. This study introduces a network structure entropy-based node importance ranking method that considers both local and global information. The method’s efficacy is validated through comparisons with three benchmarks, showcasing strong performance on two real-world datasets. Further work could explore scalability and applicability in dynamic scenarios.

Keywords: Influential nodes; Complex networks; Information entropy (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077924009007
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:187:y:2024:i:c:s0960077924009007

DOI: 10.1016/j.chaos.2024.115348

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