Signal processing on large networks with group symmetries
Abstract
Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is subject to error or natural changes over time. This motivated a new perspective on GSP, where the signal processing framework is developed for an entire class of graphs with similar structures. This approach can be formalized via the theory of graph limits, where graphs are considered as random samples from a distribution represented by a graphon. When the network under consideration has underlying symmetries, they may be modeled as samples from Cayley graphons. In Cayley graphons, vertices are sampled from a group, and the link probability between two vertices is determined by a function of the two corresponding group elements. Infinite groups such as the 1-dimensional torus can be used to model networks with an underlying spatial reality. Cayley graphons on finite groups give rise to a Stochastic Block Model, where the link probabilities between blocks form a (edge-weighted) Cayley graph. This manuscript summarizes some work on graph signal processing on large networks, in particular samples of Cayley graphons.
Cite
@article{arxiv.2303.17065,
title = {Signal processing on large networks with group symmetries},
author = {Kathryn Beck and Mahya Ghandehari and Jeannette Janssen and Nauzer Kalyaniwalla},
journal= {arXiv preprint arXiv:2303.17065},
year = {2023}
}
Comments
2 pages. This work was accepted to be presented at the Graph Signal Processing Workshop 2023