Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
Longxiu Huang, Dongyang Li, Sui Tang, Qing Yao

TL;DR
This paper develops a probabilistic sampling and reconstruction framework for sparse, bandlimited graph signals evolving over time, using a novel dynamic spectral graph coherence measure to optimize sample efficiency.
Contribution
It introduces a randomized space-time sampling scheme for graph signals governed by heat diffusion, with a new coherence measure guiding optimal sampling and reconstruction.
Findings
As few as O(s log(k)) samples suffice for accurate recovery.
The method reduces spatial sampling by leveraging temporal correlations.
Numerical experiments confirm theoretical guarantees and practical effectiveness.
Abstract
In this work, we investigate the sampling and reconstruction of spectrally -sparse bandlimited graph signals governed by heat diffusion processes. We propose a random space-time sampling regime, referred to as {randomized} dynamical sampling, where a small subset of space-time nodes is randomly selected at each time step based on a probability distribution. To analyze the recovery problem, we establish a rigorous mathematical framework by introducing the parameter \textit{the dynamic spectral graph weighted coherence}. This key parameter governs the number of space-time samples needed for stable recovery and extends the idea of variable density sampling to the context of dynamical systems. By optimizing the sampling probability distribution, we show that as few as space-time samples are sufficient for accurate reconstruction in optimal scenarios, where …
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
TopicsComplex Network Analysis Techniques
