arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.06279cs.LGeess.SP
收藏

图面容限集与唯一性集在图on信号处理中的研究

Sampling and Uniqueness Sets in Graphon Signal Processing

Alejandro Parada-Mayorga, Alejandro Ribeiro

AI总结:

本文研究了大规模图上采样集的性质,通过图on理论扩展了可移除和唯一性集的概念,展示了图on信号在不同规模和标记的图间比较采样集的统一框架。

摘要:

在本文中,我们利用图on和图极限理论研究大规模图上采样集的性质。为此,我们将最初用于图上信号分析的可移除和唯一性集的概念扩展到图on信号。我们正式定义了Λ-可移除集,并给出了在图on中当样本从给定的Λ-可移除集的补集获取时,带限图on信号能以唯一方式表示的条件。通过利用这些结果,我们展示图on表示的图和图信号可以作为比较不同节点数和边数、不同节点标记的图之间采样集的共同框架。此外,给定一个收敛到图on的图序列,我们证明了其采样集序列在[0,1]上具有相同的图on表示时也是收敛的。我们利用收敛结果提供了一种算法,以获得接近最优的采样集。通过一组数值实验,我们评估了这些采样集的质量。我们的结果为大规模图中最优采样集的高效计算打开了大门。

英文摘要:

In this work, we study the properties of sampling sets on families of large graphs by leveraging the theory of graphons and graph limits. To this end, we extend to graphon signals the notion of removable and uniqueness sets, which was developed originally for the analysis of signals on graphs. We state the formal definition of a $Λ-$removable set and conditions under which a bandlimited graphon signal can be represented in a unique way when its samples are obtained from the complement of a given $Λ-$removable set in the graphon. By leveraging such results we show that graphon representations of graphs and graph signals can be used as a common framework to compare sampling sets between graphs with different numbers of nodes and edges, and different node labelings. Additionally, given a sequence of graphs that converges to a graphon, we show that the sequences of sampling sets whose graphon representation is identical in $[0,1]$ are convergent as well. We exploit the convergence results to provide an algorithm that obtains approximately close to optimal sampling sets. Performing a set of numerical experiments, we evaluate the quality of these sampling sets. Our results open the door for the efficient computation of optimal sampling sets in graphs of large size.

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

↑