Learning Time-Varying Graph Signals via Koopman

Sivaram Krishnan, Jinho Choi, Jihong Park
11/9/2025
cs.LGeess.SP

No confident code implementation found for this paper.

Abstract

A wide variety of real-world data, such as sea measurements, e.g., temperatures collected by distributed sensors and multiple unmanned aerial vehicles (UAV) trajectories, can be naturally represented as graphs, often exhibiting non-Euclidean structures. These graph representations may evolve over time, forming time-varying graphs. Effectively modeling and analyzing such dynamic graph data is critical for tasks like predicting graph evolution and reconstructing missing graph data. In this paper, we propose a framework based on the Koopman autoencoder (KAE) to handle time-varying graph data. Specifically, we assume the existence of a hidden non-linear dynamical system, where the state vector corresponds to the graph embedding of the time-varying graph signals. To capture the evolving graph structures, the graph data is first converted into a vector time series through graph embedding, representing the structural information in a finite-dimensional latent space. In this latent space, the KAE is applied to learn the underlying non-linear dynamics governing the temporal evolution of graph features, enabling both prediction and reconstruction tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{krishnan2025learning,
  title  = {Learning Time-Varying Graph Signals via Koopman},
  author = {Sivaram Krishnan and Jinho Choi and Jihong Park},
  year   = {2025},
  eprint = {2511.06493},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.06493v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.06493.svg)](https://codeofpaper.com/paper/2511.06493)

Discussion