arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08124eess.SP
收藏

使用广义图子建模稀疏图序列与信号

Modeling Sparse Graph Sequences and Signals Using Generalized Graphons

Feng Ji, Xingchao Jian, Wee Peng Tay

AI总结:

针对稀疏图序列收敛到零图子导致传统图子信号处理失效的问题,提出基于广义图子和拉伸割距离的新框架,实现了对稀疏图序列信号的分析与处理。

摘要:

图子是图序列的极限对象,用于分析大图的行为。近期,图子信号处理被发展用于研究大图上的信号处理。该方法的一个主要局限是,任何稀疏的图序列都不可避免地收敛到零图子,导致所得的信号处理理论变得平凡,不适用于稀疏图序列。为克服这一局限,我们提出了一种新的信号处理框架,该框架利用了广义图子的概念,并引入了拉伸割距离作为比较这些图子的度量。我们的框架侧重于从广义图子中采样图序列,并探讨了相关算子、谱和信号的收敛性质。我们的信号处理框架提供了一种综合的方法来分析和处理图序列上的信号,即使它们是稀疏的。最后,我们通过数值实验讨论了该理论对现实世界大网络的实际意义。

英文摘要:

Graphons are limit objects of sequences of graphs and are used to analyze the behavior of large graphs. Recently, graphon signal processing has been developed to study signal processing on large graphs. A major limitation of this approach is that any sparse sequence of graphs inevitably converges to the zero graphon, rendering the resulting signal processing theory trivial and inadequate for sparse graph sequences. To overcome this limitation, we propose a new signal processing framework that leverages the concept of generalized graphons and introduces the stretched cut distance as a measure to compare these graphons. Our framework focuses on the sampling of graph sequences from generalized graphons and explores the convergence properties of associated operators, spectra, and signals. Our signal processing framework provides a comprehensive approach to analyzing and processing signals on graph sequences, even if they are sparse. Finally, we discuss the practical implications of our theory for real-world large networks through numerical experiments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑