# When Slepian Meets Fiedler: Putting a Focus on the Graph Spectrum

## TL;DR

This paper introduces Slepian graph signals that maximize energy concentration in subgraphs, linking spectral graph theory with clustering and embedding to enhance understanding of graph-localized signals.

## Contribution

It presents a novel design of Slepian graph signals and establishes a new connection between localized spectral signals and graph clustering.

## Key findings

- Slepian graph signals optimize energy concentration in subgraphs.
- A new link between spectral localization and graph clustering is established.
- The approach enhances analysis of localized signals on graphs.

## Abstract

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.