Power Spectrum Signatures of Graphs

Karamatou Yacoubou Djima, Ka Man Yim
3/12/2025
stat.MLcs.LGcs.SI

No confident code implementation found for this paper.

Abstract

Point signatures based on the Laplacian operators on graphs, point clouds, and manifolds have become popular tools in machine learning for graphs, clustering, and shape analysis. In this work, we propose a novel point signature, the power spectrum signature, a measure on $\mathbb{R}$ defined as the squared graph Fourier transform of a graph signal. Unlike eigenvectors of the Laplacian from which it is derived, the power spectrum signature is invariant under graph automorphisms. We show that the power spectrum signature is stable under perturbations of the input graph with respect to the Wasserstein metric. We focus on the signature applied to classes of indicator functions, and its applications to generating descriptive features for vertices of graphs. To demonstrate the practical value of our signature, we showcase several applications in characterizing geometry and symmetries in point cloud data, and graph regression problems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{djima2025power,
  title  = {Power Spectrum Signatures of Graphs},
  author = {Karamatou Yacoubou Djima and Ka Man Yim},
  year   = {2025},
  eprint = {2503.09660},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.09660v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.09660.svg)](https://codeofpaper.com/paper/2503.09660)

Discussion