Graph Equivalence Classes for Spectral Projector-Based Graph Fourier Transforms
Social and Information Networks
2017-01-12 v1
Abstract
We define and discuss the utility of two equivalence graph classes over which a spectral projector-based graph Fourier transform is equivalent: isomorphic equivalence classes and Jordan equivalence classes. Isomorphic equivalence classes show that the transform is equivalent up to a permutation on the node labels. Jordan equivalence classes permit identical transforms over graphs of nonidentical topologies and allow a basis-invariant characterization of total variation orderings of the spectral components. Methods to exploit these classes to reduce computation time of the transform as well as limitations are discussed.
Cite
@article{arxiv.1701.02864,
title = {Graph Equivalence Classes for Spectral Projector-Based Graph Fourier Transforms},
author = {Joya A. Deri and José M. F. Moura},
journal= {arXiv preprint arXiv:1701.02864},
year = {2017}
}