A noncommutative approach to the graphon Fourier transform
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916299007852544 |
|---|---|
| author | Ghandehari, Mahya Janssen, Jeannette Kalyaniwalla, Nauzer |
| author_facet | Ghandehari, Mahya Janssen, Jeannette Kalyaniwalla, Nauzer |
| contents | Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large graphs of similar structure may be represented by a graphon. Theoretically, graphons are limit objects of converging sequences of graphs. Our work extends previous research aiming to provide a common scheme for signal analysis of graphs that are similar in structure to a graphon. We extend a previous definition of graphon Fourier transform, and show that the graph Fourier transforms of graphs in a converging graph sequence converge to the graphon Fourier transform of the limiting graphon. We then apply this convergence result to signal processing on Cayley graphons. We show that Fourier analysis of the underlying group enables the construction of a suitable eigen-decomposition for the graphon, which can be used as a common framework for signal processing on graphs converging to the graphon. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_08646 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | A noncommutative approach to the graphon Fourier transform Ghandehari, Mahya Janssen, Jeannette Kalyaniwalla, Nauzer Combinatorics 2010: Primary 42C15. Secondary 05C50, 94A12 Signal analysis on graphs relies heavily on the graph Fourier transform, which is defined as the projection of a signal onto an eigenbasis of the associated shift operator. Large graphs of similar structure may be represented by a graphon. Theoretically, graphons are limit objects of converging sequences of graphs. Our work extends previous research aiming to provide a common scheme for signal analysis of graphs that are similar in structure to a graphon. We extend a previous definition of graphon Fourier transform, and show that the graph Fourier transforms of graphs in a converging graph sequence converge to the graphon Fourier transform of the limiting graphon. We then apply this convergence result to signal processing on Cayley graphons. We show that Fourier analysis of the underlying group enables the construction of a suitable eigen-decomposition for the graphon, which can be used as a common framework for signal processing on graphs converging to the graphon. |
| title | A noncommutative approach to the graphon Fourier transform |
| topic | Combinatorics 2010: Primary 42C15. Secondary 05C50, 94A12 |
| url | https://arxiv.org/abs/2109.08646 |