图傅里叶变换的非交换方法
A noncommutative approach to the graphon Fourier transform
AI总结:
本研究提出图傅里叶变换的非交换方法,拓展图on傅里叶变换定义,证明收敛图序列的图傅里叶变换收敛于极限图on的对应变换,并将其应用于Cayley图on,构建统一的图信号处理框架。
摘要:
图上的信号分析高度依赖图傅里叶变换,其定义为信号向关联移位算子的特征基的投影。结构相似的大图可由图on(graphon)表示,理论上,图on是收敛图序列的极限对象。本工作拓展了先前旨在为结构与某一图on相似的图提供统一信号分析方案的研究。我们推广了先前的图on傅里叶变换定义,并证明收敛图序列中各图的图傅里叶变换收敛于极限图on的图on傅里叶变换。随后我们将该收敛结果应用于Cayley图on的信号处理,证明底层群的傅里叶分析可构建适用于该图on的特征分解,可作为收敛于该图on的图上信号处理的统一框架。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。