当Slepian遇到Fiedler:将焦点放在图谱上
When Slepian Meets Fiedler: Putting a Focus on the Graph Spectrum
摘要:
复杂系统的研究得益于图模型及其分析。特别是,图拉普拉斯算子的特征分解让全局组织的性质从局部相互作用中显现出来;例如,Fiedler向量具有最小的非零特征值,并且对于图聚类起关键作用。图形信号处理侧重于分析归因于图形节点的信号。图形拉普拉斯算子的特征分解允许定义图形傅立叶变换并将传统的信号处理操作扩展到图形。在这里,我们介绍了Slepian图信号的设计,通过最大限度地提高能量集中在一个预定义的子图的图形频谱带宽。我们建立了一个新的链接与经典的拉普拉斯嵌入和图聚类,这提供了一个意义本地化的图频率。
英文摘要:
The study of complex systems benefits from graph models and their analysis. In particular, the eigendecomposition of the graph Laplacian lets emerge properties of global organization from local interactions; e.g., the Fiedler vector has the smallest non-zero eigenvalue and plays a key role for graph clustering. Graph signal processing focusses on the analysis of signals that are attributed to the graph nodes. The eigendecomposition of the graph Laplacian allows to define the graph Fourier transform and extend conventional signal-processing operations to graphs. Here, we introduce the design of Slepian graph signals, by maximizing energy concentration in a predefined subgraph for a graph spectral bandlimit. We establish a novel link with classical Laplacian embedding and graph clustering, which provides a meaning to localized graph frequencies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。