5 papers
Induced Embeddings of Graphs into Abelian Cayley Graphs
Rigobert Fokam Souop, Laurent Bitjoka
For a finite graph on vertices, let denote the least order of a finite abelian group for which is an induced subgraph of some Cayley graph of . Babai and…
Signal-Aware Cayley Completion: Choosing Between an Exact and a Lossy Abelian Host
Rigobert Fokam Soup, Laurent Bitjoka
Group-embedding graph signal processing buys exact Fourier analysis either by enlarging the domain until a graph embeds isometrically into an abelian Cayley graph, or by perturbing…
The Cayley Completion of a Graph
Rigobert Fokam Souop, Laurent Bitjoka
A finite connected graph is rarely a Cayley graph. We measure how far it is from being one: given with vertices and edges, how few edges must be added, or added and del…
Tight Wavelet Frames on Graphs via Isometric Group Embedding
Rigobert Fokam Souop, Laurent Bitjoka
Spectral graph wavelets apply a kernel to the graph Laplacian spectrum. On an irregular graph their analyzing functions inherit a non-canonical eigenbasis, they do not form a tight…
Harmonic Analysis on Graphs via Isometric Group Embedding: A Canonical Fourier Transform, Shift, and Convolution for Network Signals
Rigobert Fokam Souop, Laurent Bitjoka
Graph signal processing built on the eigenvectors of a Laplacian or adjacency shift inherits three structural compromises: the eigenbasis is fixed only up to rotation within degene…