Jul 2026· IEEE Transactions on Neural Networks and Learning Systems· Vol PP· 0 citations
Medicine
TL;DR
A novel theoretical model, namely the multiway autoregressive (MARS) model, which characterizes multiple evolutionary paths by capturing dependencies within and across two core factors underlying diverse evolutionary mechanisms is proposed, which develops a general DGNN framework, a multiway autoregressive network (MAN).
Abstract
Understanding how links form and predicting future link states is of great importance in social, traffic, and many other complex temporal networks. These temporal networks are typically governed by multiple evolutionary mechanisms. However, existing dynamic graph representation methods, especially dynamic graph neural networks (DGNNs), are constrained by their single-evolutionary-path architecture, where spatial and temporal dynamics are either sequentially stacked or integrated into a monolithic module in a fixed manner. This design not only restricts the exploration of diverse evolutionary paths arising from rich evolutionary mechanisms but also confines spatiotemporal interactions to passive and implicit modeling, resulting in compromised performance and weak interpretability. To address these issues, we propose a novel theoretical model, namely the multiway autoregressive (MARS) model, which characterizes multiple evolutionary paths by capturing dependencies within and across two core factors underlying diverse evolutionary mechanisms. Based on this theoretical foundation, we develop a general DGNN framework, a multiway autoregressive network (MAN), by transforming the network architecture into a 2-D diagram that characterizes evolutionary dependencies in the spatiotemporal domain. Each node encodes an evolving state of the dynamic graph representation, while each edge denotes an evolutionary transition from one state to another. Moreover, three elementary evolutionary operators are incorporated into edges along distinct directions, capturing spatialwise, temporalwise, and cross-spatiotemporal evolutionary dynamics, respectively. This enables researchers to develop a variety of DGNNs by configuring the evolutionary operators in different ways. To validate the effectiveness of this framework, we design a new DGNN, which employs a graph convolutional network (GCN), a gated recurrent unit (GRU), and our proposed time-delayed GCN (TD-GCN) as core components. Promising experimental results demonstrate that the proposed approach achieves state-of-the-art temporal link prediction performance on both synthetic and real-world temporal networks across diverse domains.
This work proposes a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs that is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics.
Mohammad Ostadmohammadi, S. Kazemi, H. R. Rabiee· arXiv.org· 0 citations
A Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is “global basis, dynamic weights”, which learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs.
The framework gives a nonparametric baseline for dynamic network analysis with explicit convergence guarantees and establishes nonparametric convergence rates in both block-model and Holder-smooth regimes.
Understanding temporal dynamics in complex systems often requires identifying abrupt structural changes, known as change points in multivariate time series. Traditional vector autoregressive (VAR) models have been widely used for modeling dependencies across time, yet their parameter space grows quadratically with the number of variables, leading to computational and estimation challenges in high‐dimensional settings. The recently proposed network autoregressive (NAR) modeling framework offers a computationally efficient alternative by reducing parameter complexity through a network‐based representation. However, existing NAR models either assume homogeneous temporal behavior across all nodes, overlooking node‐specific dynamics that frequently arise in environmental and socio‐economic systems, or do not allow for structural breaks. In this work, we propose
NLDNAR‐CP
, a novel change point detection method within a node‐specific NAR framework that accommodates heterogeneous temporal dependencies across variables. The proposed approach efficiently detects multiple structural breaks while preserving scalability to high‐dimensional networks. We demonstrate the method's superior empirical performance through extensive simulations and a real‐world environmental application.
This framework introduces an adaptive graph learning module that dynamically infers meaningful connectivity relationships among traffic sensors—not relying on fixed geographic or distance-based assumptions—but instead leveraging real-time traffic correlations and node-level embeddings, enabling effective modeling of both localized spatial interactions and multi-scale temporal dependencies across varying prediction horizons.
Zhengxu Luan, Huan Wang, Miaobowen Wang et al.· Computers and artificial int...· 0 citations