Graph Canonical Coherence Analysis

We propose graph canonical coherence analysis (gCChA), a novel framework that extends canonical correlation analysis to multivariate graph signals in the graph frequency domain. The proposed method addresses challenges posed by the inherent features of graphs: discreteness, finiteness, and irregularity. It identifies pairs of canonical graph signals that maximize their coherence, enabling the exploration of relationships between two sets of graph signals from a spectral perspective. This framework shows how these relationships change across different structural scales of the graph. We demonstrate the usefulness of this method through applications to economic and energy datasets of G20 countries and the USPS handwritten digit dataset.