A lightweight graph neural network with decoupled static and dynamic representations for temporal link prediction in social networks

Temporal Link Prediction (TLP) is a key task in social network research, aiming to predict future network links based on the relative behaviors of previous network changes. The various interaction patterns and nonlinear characteristics of the dynamic network pose challenges for the design of accurate general prediction algorithms. With the development of deep learning technology, graph neural networks (GNNs) have been widely applied to solve graph-related problems and have achieved significant results. However, solving the TLP problem based on GNNs usually involves complex memory update mechanisms, multi-layer iterative message passing paradigms, and reliance on negative sampling strategies, all of which contribute to the overall model’s complexity. To reduce model complexity while maintaining high accuracy, this paper proposes a lightweight temporal aggregation graph neural network model (LAGNN) that uses only a single layer to solve the TLP problem. This model decouples the static identity representation of nodes from their dynamic interaction context, simplifying the message passing mechanism and training objective while preserving the accuracy of temporal link predictions and significantly improving efficiency. The core of LAGNN lies in decoupling representation modeling: static embeddings capture inherent node identities, and a temporal attention module aggregates historical neighbor information to generate context‑aware dynamic node representations. During training, LAGNN optimizes an objective function that maximizes the similarity between positive samples, thereby avoiding the inherent instability and bias of negative sampling strategies. At inference time, the model uses the static embeddings of all candidate nodes and only needs to compute the dynamic representation of the source node. Experimental results on temporal link prediction tasks using four public dynamic social network datasets demonstrate that, despite using only a single‑layer architecture, LAGNN achieves predictive accuracy comparable to or even surpassing state-of-the-art multi-layer methods while also validating its efficiency and stability advantages.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-14
DOI
https://doi.org/10.1038/s41598-026-77774-1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A lightweight graph neural network with decoupled static and dynamic representations for temporal link prediction in social networks

Hsieh MengYen, Florin Pop, Lihong Han, Kuanching Li et al.
Scientific Reports
Advanced Graph Neural Networks
article

A lightweight graph neural network with decoupled static and dynamic representations for temporal link prediction in social networks

Hsieh MengYen, Florin Pop, Lihong Han, Kuanching Li, Mingming Li, Kuen-Wei Li
article en

Abstract

Temporal Link Prediction (TLP) is a key task in social network research, aiming to predict future network links based on the relative behaviors of previous network changes. The various interaction patterns and nonlinear characteristics of the dynamic network pose challenges for the design of accurate general prediction algorithms. With the development of deep learning technology, graph neural networks (GNNs) have been widely applied to solve graph-related problems and have achieved significant results. However, solving the TLP problem based on GNNs usually involves complex memory update mechanisms, multi-layer iterative message passing paradigms, and reliance on negative sampling strategies, all of which contribute to the overall model’s complexity. To reduce model complexity while maintaining high accuracy, this paper proposes a lightweight temporal aggregation graph neural network model (LAGNN) that uses only a single layer to solve the TLP problem. This model decouples the static identity representation of nodes from their dynamic interaction context, simplifying the message passing mechanism and training objective while preserving the accuracy of temporal link predictions and significantly improving efficiency. The core of LAGNN lies in decoupling representation modeling: static embeddings capture inherent node identities, and a temporal attention module aggregates historical neighbor information to generate context‑aware dynamic node representations. During training, LAGNN optimizes an objective function that maximizes the similarity between positive samples, thereby avoiding the inherent instability and bias of negative sampling strategies. At inference time, the model uses the static embeddings of all candidate nodes and only needs to compute the dynamic representation of the source node. Experimental results on temporal link prediction tasks using four public dynamic social network datasets demonstrate that, despite using only a single‑layer architecture, LAGNN achieves predictive accuracy comparable to or even surpassing state-of-the-art multi-layer methods while also validating its efficiency and stability advantages.

Scientific Reports
National Taichung University of Science and Technology (TW), Providence University (TW), Academia Oamenilor de Știință din România (RO), Gansu Province Computing Center (CN), National Institute for Research and Development in Informatics - ICI Bucharest (RO), Lanzhou University of Finance and Economics (CN), Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Advanced Graph Neural Networks
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.

Laika access coming soon