Modeling and identifying influential nodes in complex networks using graph embedding and temporal decay information

Identifying influential nodes in complex networks is a fundamental problem with important applications in information diffusion, epidemic control, and viral marketing. A major challenge in this task is that most existing centrality-based approaches rely primarily on static topological properties of networks while ignoring latent structural relationships and the temporal evolution of influence. In real-world social systems, however, the impact of nodes is shaped not only by their structural position but also by temporal dynamics such as the gradual decay of user attention to information over time. In this paper, we propose a novel framework for modeling and identifying influential nodes by integrating graph embedding techniques with temporal decay information (GETD). First, the network is mapped into a low-dimensional vector space using graph embedding, enabling the preservation of structural proximity and hidden relationships between nodes. Then, to better reflect realistic diffusion processes, we further incorporate a temporal decay mechanism that models the diminishing influence of nodes during information spreading. By combining embedding-based structural features with decay-aware dynamics, we design a hybrid influence estimation approach that captures both the network topology and the temporal attenuation of spreading processes. Extensive experiments conducted on multiple real-world networks demonstrate the effectiveness of the proposed GETD metric. Meanwhile, GETD achieves an average Kendall rank correlation of 0.852 and influence spread to a 2.4% improvement in node ranking performance.

Authors

Institutions

Publication Details

Journal
Chaos Solitons & Fractals
Published
2026-09-30
DOI
https://doi.org/10.1016/j.chaos.2026.119271
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Modeling and identifying influential nodes in complex networks using graph embedding and temporal decay information

Yanfeng Xue, Mao Ni
Chaos Solitons & Fractals
Complex Network Analysis Techniques
article

Modeling and identifying influential nodes in complex networks using graph embedding and temporal decay information

Yanfeng Xue, Mao Ni
article en

Abstract

Identifying influential nodes in complex networks is a fundamental problem with important applications in information diffusion, epidemic control, and viral marketing. A major challenge in this task is that most existing centrality-based approaches rely primarily on static topological properties of networks while ignoring latent structural relationships and the temporal evolution of influence. In real-world social systems, however, the impact of nodes is shaped not only by their structural position but also by temporal dynamics such as the gradual decay of user attention to information over time. In this paper, we propose a novel framework for modeling and identifying influential nodes by integrating graph embedding techniques with temporal decay information (GETD). First, the network is mapped into a low-dimensional vector space using graph embedding, enabling the preservation of structural proximity and hidden relationships between nodes. Then, to better reflect realistic diffusion processes, we further incorporate a temporal decay mechanism that models the diminishing influence of nodes during information spreading. By combining embedding-based structural features with decay-aware dynamics, we design a hybrid influence estimation approach that captures both the network topology and the temporal attenuation of spreading processes. Extensive experiments conducted on multiple real-world networks demonstrate the effectiveness of the proposed GETD metric. Meanwhile, GETD achieves an average Kendall rank correlation of 0.852 and influence spread to a 2.4% improvement in node ranking performance.

Chaos Solitons & FractalsVol. 213
Wuhan Business University (CN), Luliang University (CN)
Good health and well-being
Openalex Percentile: Top 11%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Modeling and identifying influential nodes in complex networks using graph embedding and temporal decay information — Yanfeng Xue, Mao Ni · Chaos Solitons & Fractals (2026) | TGRS Research Map | TGRS