Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations
Liyan Chen, Samuel Cheng, Vlandimir Stankovic, and Lina Stankovic

TL;DR
This paper introduces the concept of shift-enabled graphs in graph signal processing, highlighting that shift-invariance and polynomial representability depend on specific matrix properties, which impacts filter design.
Contribution
It defines shift-enabled graphs, provides examples of non-shift-enabled graphs, and demonstrates that shift-invariant filters may not always be polynomial functions of the adjacency matrix.
Findings
Not all graphs are shift-enabled, affecting filter representation.
Shift-invariance may not be preserved under graph modifications.
Further research is needed to understand shift-enabled graphs in practice.
Abstract
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a shift-invariant graph filter can be represented as a polynomial of the adjacency (shift) matrix of the graph. However, the characteristic and minimum polynomials of the adjacency matrix must be identical for the property to hold. While it has been suggested that this condition might be ignored as it is always possible to find a polynomial transform to represent the original adjacency matrix by another adjacency matrix that satisfies the condition, this letter shows that a filter that is shift invariant in terms of the original graph may not be shift invariant anymore under the modified graph and vice versa. We introduce the notion of "shift-enabled graph" for…
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.
