Link prediction in multiplex social networks based on information transmission graph neural networks

Social networks are omnipresent graph-structured data where entities and interactions between them can be modeled as nodes and edges, respectively. In recent years, graph neural networks (GNNs) have evolved as a mainstream and powerful model for handling graph data. Link prediction, which can foretell missing or potential links, is a crucial task in social network analysis. However, most existing methods focus on monolayer networks and usually ignore that multiplex networks have richer information, which often results in poor performance on link prediction. Therefore, this paper proposes an information transmission-based GNN (IT-GNN) model for link prediction in multiplex social networks. IT-GNN first learns the representation of each node in a multiplex network from itself and its neighborhood. Specifically, the neighborhood information of a node is learned from its 1-, 2- and 3-hop neighbors in combination with the three new ways of information transmission. Then, the embedding of a node pair is obtained based on these representations. In this regard, the final representations of potential links in the target layer, which are used to determine the existence of potential links, are generated by fusing their embeddings from all layers. Extensive experiments on seven real-world networks demonstrate the superior performance of the proposed model.

Authors

Institutions

Publication Details

Journal
International Journal of Modern Physics C
Published
2025-11-21
DOI
https://doi.org/10.1142/s0129183127500252
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
article

Link prediction in multiplex social networks based on information transmission graph neural networks

Wenbin Yuan, Longjie Li, Lei Si, Zhixin Ma
International Journal of Modern Physics C
Advanced Graph Neural Networks
article

Link prediction in multiplex social networks based on information transmission graph neural networks

Wenbin Yuan, Longjie Li, Lei Si, Zhixin Ma
article en

Abstract

Social networks are omnipresent graph-structured data where entities and interactions between them can be modeled as nodes and edges, respectively. In recent years, graph neural networks (GNNs) have evolved as a mainstream and powerful model for handling graph data. Link prediction, which can foretell missing or potential links, is a crucial task in social network analysis. However, most existing methods focus on monolayer networks and usually ignore that multiplex networks have richer information, which often results in poor performance on link prediction. Therefore, this paper proposes an information transmission-based GNN (IT-GNN) model for link prediction in multiplex social networks. IT-GNN first learns the representation of each node in a multiplex network from itself and its neighborhood. Specifically, the neighborhood information of a node is learned from its 1-, 2- and 3-hop neighbors in combination with the three new ways of information transmission. Then, the embedding of a node pair is obtained based on these representations. In this regard, the final representations of potential links in the target layer, which are used to determine the existence of potential links, are generated by fusing their embeddings from all layers. Extensive experiments on seven real-world networks demonstrate the superior performance of the proposed model.

International Journal of Modern Physics C
Lanzhou University (CN)
Openalex Percentile: Top 81%
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.