Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI

With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI) theory to the graph domain, and can be applied to arbitrary graphs via suitable approximation schemes. At its core, the introduced Graph-FRI-framework states that any K-sparse signal on the vertices of a circulant graph can be perfectly reconstructed from its dimensionality-reduced representation in the graph spectral domain, the Graph Fourier Transform (GFT), of minimum size 2K. By leveraging the recently developed theory of e-splines and e-spline wavelets on graphs, one can decompose this graph spectral transformation into the multiresolution low-pass filtering operation with a graph e-spline filter, and subsequent transformation to the spectral graph domain; this allows to infer a distinct sampling pattern, and, ultimately, the structure of an associated coarsened graph, which preserves essential properties of the original, including circularity and, where applicable, the graph generating set.Comment: To appear in Appl. Comput. Harmon. Anal. (2017

On the K-theory of twisted higher-rank-graph C*-algebras

We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras. We show that each 2-cocycle on a higher-rank graph taking values in an abelian group determines a continuous bundle of twisted higher-rank graph algebras over the dual group. We use this to show that for a circle-valued 2-cocycle on a higher-rank graph obtained by exponentiating a real-valued cocycle, the K-theory of the twisted higher-rank graph algebra coincides with that of the untwisted one.Comment: 15 pages; four diagrams prepared in Tik