Poisson-Gamma Modeling of Inter-Relational Dependencies in Dynamic Knowledge Graphs

• URL: http://arxiv.org/abs/2607.02872v1
• Date: Fri, 03 Jul 2026 02:19:52 GMT
• Title: Poisson-Gamma Modeling of Inter-Relational Dependencies in Dynamic Knowledge Graphs
• Abstract summary: PGRE (PoGisson-amma Evolution) is a model for modeling inter-relational dependencies in dynamic knowledge graphs.<n>A Gamma Markov process further models the temporal evolution of latent variables, enabling principled characterization of relational dynamics.
• Score: 13.337906358005077
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dynamic knowledge graphs are ubiquitous in today's AI applications, as we represent molecular structures, social relationships, and language information using these graph models. As knowledge graphs evolve over time and are often noisy and incomplete, modeling their temporal and relational dependencies becomes crucial for downstream tasks. To address these challenges, this paper proposes PGRE (Poisson-Gamma Relational Evolution), a probabilistic model for modeling inter-relational dependencies in dynamic knowledge graphs. PGRE represents multi-relational temporal links via a Poisson-Bernoulli formulation. It introduces Gamma-distributed latent variables to capture entity-factor associations and cross-relation dependencies mediated by shared latent communities. A Gamma Markov process further models the temporal evolution of these latent variables, enabling principled characterization of relational dynamics. Experiments on benchmark datasets show that PGRE achieves competitive performance in link prediction, particularly in sparse settings, while revealing meaningful relational evolution patterns in dynamic knowledge graphs.

Related papers

• Topology Identification and Inference over Graphs [61.06365536861156]
  Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
  arXiv  Detail & Related papers  (2025-12-11T00:47:09Z)
• SDGF: Fusing Static and Multi-Scale Dynamic Correlations for Multivariate Time Series Forecasting [9.027814258970684]
  Inter-series correlations are crucial for accurate time series forecasting.<n>These relationships often exhibit complex dynamics across different temporal scales.<n>Existing methods are limited in modeling these multi-scale dependencies.
  arXiv  Detail & Related papers  (2025-09-14T11:23:12Z)
• Clustering Time-Evolving Networks Using the Spatio-Temporal Graph Laplacian [0.8643517734716606]
  We generalize existing spectral algorithms to identify and analyze communities in time-varying graph structures.<n>We show that thetemporal-directed graph Laplacian allows for a clear interpretation of cluster structure evolution over time for directed and undirected clusters.
  arXiv  Detail & Related papers  (2024-07-12T14:31:54Z)
• PGODE: Towards High-quality System Dynamics Modeling [40.76121531452706]
  This paper studies the problem of modeling multi-agent dynamical systems, where agents could interact mutually to influence their behaviors. Recent research predominantly uses geometric graphs to depict these mutual interactions, which are then captured by graph neural networks (GNNs) We propose a new approach named Prototypical Graph ODE to address the problem.
  arXiv  Detail & Related papers  (2023-11-11T12:04:47Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Inferring dynamic regulatory interaction graphs from time series data with perturbations [14.935318448625718]
  We propose Regulatory Temporal Interaction Network Inference (RiTINI) for inferring time-varying interaction graphs in complex systems. RiTINI uses a novel combination of space-and-time graph attentions and graph neural ordinary differential equations (ODEs) We evaluate RiTINI's performance on various simulated and real-world datasets.
  arXiv  Detail & Related papers  (2023-06-13T14:25:26Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• Navigating the Dynamics of Financial Embeddings over Time [0.0]
  We propose the application of Graph Representation Learning in a scalable dynamic setting. We perform a rigorous qualitative analysis of the latent trajectories to extract real world insights.
  arXiv  Detail & Related papers  (2020-07-01T16:27:31Z)
• Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks [91.65637773358347]
  We propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module. Our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets.
  arXiv  Detail & Related papers  (2020-05-24T04:02:18Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

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.