Time-Varying Graph Mode Decomposition
Naveed ur Rehman

TL;DR
This paper introduces a novel method for decomposing time-varying graph signals into interpretable modes, capturing their temporal, spectral, and topological features using a data-driven variational approach.
Contribution
It proposes a new graph mode decomposition technique based on a variational formulation and ADMM optimization, enabling joint analysis of temporal and topological properties.
Findings
Effective decomposition of synthetic data demonstrating mode interpretability
Application to real data showing insights into functional connectivity
Method outperforms existing approaches in capturing multi-scale features
Abstract
Time-varying graph signals are alternative representation of multivariate (or multichannel) signals in which a single time-series is associated with each of the nodes or vertex of a graph. Aided by the graph-theoretic tools, time-varying graph models have the ability to capture the underlying structure of the data associated with multiple nodes of a graph -- a feat that is hard to accomplish using standard signal processing approaches. The aim of this contribution is to propose a method for the decomposition of time-varying graph signals into a set of graph modes. The graph modes can be interpreted in terms of their temporal, spectral and topological characteristics. From the temporal (spectral) viewpoint, the graph modes represent the finite number of oscillatory signal components (output of multiple band-pass filters whose center frequencies and bandwidths are learned in a fully…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques
