A dynamic graph (DG) is frequently encountered in numerous real-world scenarios. Consequently, A dynamic graph convolutional network (DGCN) has been successfully applied to perform precise representation learning on a DG. However, conventional DGCNs typically consist of a static GCN coupled with a sequence neural network (SNN) to model spatial and temporal patterns separately. This decoupled modeling mechanism inherently disrupts the intricate spatio-temporal dependencies. To address the issue, this study proposes a novel Tensorized Lightweight Graph Convolutional Network (TLGCN) for accurate dynamic graph learning. It mainly contains the following two key concepts: a) designing a novel spatio-temporal information propagation method for joint propagation of spatio-temporal information based on the tensor M-product framework; b) proposing a tensorized lightweight graph convolutional network based on the above method, which significantly reduces the memory occupation of the model by omitting complex feature transformation and nonlinear activation. Numerical experiments on four real-world datasets demonstrate that the proposed TLGCN outperforms the state-of-the-art models in the weight estimation task on DGs.

Dynamic graphs offer more precise modeling of real-world applications compared to static graphs. Therefore, learning on dynamic graphs has garnered significant research attention in recent years. Unfortunately, the current approaches for learning dynamic graphs remain inadequate in capturing global spatial-temporal dependency. This issue arises from capturing biased spatial and temporal dependencies, thereby weakening the coupling between spatial and temporal dimensions. To overcome it, we propose a Self-Reliant Global Dependency Apprehending Framework on Dynamic Graphs, namely SGD-DyG. Specifically, we first design a frequency self-enhanced learning module that examines the global inherent interactions of the node features hidden in the frequency domain. Furthermore, we propose a global-local-mixed self-supervised learning module that maximizes spatial-temporal mutual information between local node and global graph embeddings. Extensive experiments on seven real-world dynamic graph datasets validate that the proposed SGD-DyG consistently exceeds state-of-the-art models.