Link prediction on multi-relational graphs from an influence propagation perspective

• URL: http://arxiv.org/abs/2608.05016v1
• Date: Wed, 05 Aug 2026 16:21:46 GMT
• Title: Link prediction on multi-relational graphs from an influence propagation perspective
• Abstract summary: Predicting the existence and type of links (edges) between nodes in a multi-relational graph is key for applications from social interaction prediction to knowledge relationship identification.<n>We address this by modeling the relationship between node pairs as node influence.<n>We propose the Influential Graph Neural Predictor, referred to as IGNP, a link prediction framework guided by influence propagation.
• Score: 51.14502982773836
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Predicting the existence and type of links (edges) between nodes in a multi-relational graph is key for applications from social interaction prediction to knowledge relationship identification. Enhancing local features with relevant global information is crucial for accurate link prediction, yet it remains challenging. We address this by modeling the relationship between node pairs as node influence. That is, whether the node influence can be propagated and what type of influence is propagated indicates where and what type the edge is, which will be the most relevant local and global information to predict the edges. To this end, we extend the Susceptible-Infectious-Recovered (SIR) epidemic model to capture the influence propagation of nodes on a large scale through sub-graph structures. Subsequently, these sub-graphs are compressed using virtual edges, thereby substantially reducing the computation associated with utilizing the global graph structure. Finally, we propose the Influential Graph Neural Predictor, referred to as IGNP, a link prediction framework guided by influence propagation. Extensive experiments demonstrate the superiority of the proposed method, which outperforms strong baselines by a large margin on the widely used and real-world datasets.

Related papers

• GISExplainer: On Explainability of Graph Neural Networks via Game-theoretic Interaction Subgraphs [21.012180171806456]
  GISExplainer is a novel game-theoretic interaction based explanation method.<n>It uncovers what the underlying GNNs have learned for node classification by discovering human-interpretable causal explanatory subgraphs.<n>Extensive experiments demonstrate that GISExplainer achieves better performance than state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-09-24T03:24:31Z)
• Revealing Decurve Flows for Generalized Graph Propagation [108.80758541147418]
  This study addresses the limitations of the traditional analysis of message-passing, central to graph learning, by defining em textbfgeneralized propagation with directed and weighted graphs. We include a preliminary exploration of learned propagation patterns in datasets, a first in the field.
  arXiv  Detail & Related papers  (2024-02-13T14:13:17Z)
• Variational Disentangled Graph Auto-Encoders for Link Prediction [10.390861526194662]
  This paper proposes a novel framework with two variants, the disentangled graph auto-encoder (DGAE) and the variational disentangled graph auto-encoder (VDGAE) The proposed framework infers the latent factors that cause edges in the graph and disentangles the representation into multiple channels corresponding to unique latent factors.
  arXiv  Detail & Related papers  (2023-06-20T06:25:05Z)
• Discovering the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions [51.597480162777074]
  Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions. Recent works point out that different graph learning tasks require different ranges of interactions between nodes. We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
  arXiv  Detail & Related papers  (2022-05-15T11:38:14Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Curvature Graph Neural Network [8.477559786537919]
  We introduce discrete graph curvature (the Ricci curvature) to quantify the strength of structural connection of pairwise nodes. We propose Curvature Graph Neural Network (CGNN), which effectively improves the adaptive locality ability of GNNs. The experimental results on synthetic datasets show that CGNN effectively exploits the topology structure information.
  arXiv  Detail & Related papers  (2021-06-30T00:56:03Z)
• DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendation [11.120241862037911]
  Heterogeneous information network has been widely used to alleviate sparsity and cold start problems in recommender systems. We propose a novel disentangled heterogeneous graph attention network DisenHAN for top-$N$ recommendation.
  arXiv  Detail & Related papers  (2021-06-21T06:26:10Z)
• Adversarial Graph Disentanglement [47.27978741175575]
  A real-world graph has a complex topological structure, which is often formed by the interaction of different latent factors. We propose an underlinetextbfAdversarial underlinetextbfDisentangled underlinetextbfGraph underlinetextbfConvolutional underlinetextbfNetwork (ADGCN) for disentangled graph representation learning.
  arXiv  Detail & Related papers  (2021-03-12T14:11:36Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)
• Self-Supervised Graph Representation Learning via Global Context Prediction [31.07584920486755]
  This paper introduces a novel self-supervised strategy for graph representation learning by exploiting natural supervision provided by the data itself. We randomly select pairs of nodes in a graph and train a well-designed neural net to predict the contextual position of one node relative to the other. Our underlying hypothesis is that the representations learned from such within-graph context would capture the global topology of the graph and finely characterize the similarity and differentiation between nodes.
  arXiv  Detail & Related papers  (2020-03-03T15:46:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.