Shift-invariant spaces, bandlimited spaces and reproducing kernel spaces with shift-invariant kernels on undirected finite graphs

In this paper, we introduce the concept of graph shift-invariant space (GSIS) on an undirected finite graph, which is the linear space of graph signals being invariant under graph shifts, and we study its bandlimiting, kernel reproducing and sampling properties. Graph bandlimited spaces have been widely applied where large datasets on networks need to be handled efficiently. In this paper, we show that every GSIS is a bandlimited space, and every bandlimited space is a principal GSIS. Functions in a reproducing kernel Hilbert space with shift-invariant kernel could be learnt with significantly low computational cost. In this paper, we demonstrate that every GSIS is a reproducing kernel Hilbert space with a shift-invariant kernel. Based on the nested Krylov structure of GSISs in the spatial domain, we propose a novel sampling and reconstruction algorithm with finite steps, with its performance tested for well-localized signals on circulant graphs and flight delay dataset of the 50 busiest airports in the USA.

Barron Space for Graph Convolution Neural Networks

Graph convolutional neural network (GCNN) operates on graph domain and it has achieved a superior performance to accomplish a wide range of tasks. In this paper, we introduce a Barron space of functions on a compact domain of graph signals. We prove that the proposed Barron space is a reproducing kernel Banach space, it can be decomposed into the union of a family of reproducing kernel Hilbert spaces with neuron kernels, and it could be dense in the space of continuous functions on the domain. Approximation property is one of the main principles to design neural networks. In this paper, we show that outputs of GCNNs are contained in the Barron space and functions in the Barron space can be well approximated by outputs of some GCNNs in the integrated square and uniform measurements. We also estimate the Rademacher complexity of functions with bounded Barron norm and conclude that functions in the Barron space could be learnt from their random samples efficiently.