# Partition of Unity Methods for Signal Processing on Graphs

arXiv: https://arxiv.org/abs/2012.10636 · HTML: https://mlsanity.com/paper/2012.10636/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Dec 2020.

## Built on by (most cited first, 5 of 5)

- [Ensemble and Mixture-of-Experts DeepONets For Operator Learning](https://mlsanity.com/paper/2405.11907/) (2024)
- [CAMEL: Curvature-Augmented Manifold Embedding and Learning](https://mlsanity.com/paper/2303.02561/) (2023)
- [Kernel-Based Models for Influence Maximization on Graphs based on Gaussian Process Variance Minimization](https://mlsanity.com/paper/2103.01575/) (2021)
- [Windowed Fourier Analysis for Signal Processing on Graph Bundles](https://mlsanity.com/paper/2302.05592/) (2023)
- [Graph Neural Networks for Community Detection in Graph Signal Analysis](https://mlsanity.com/paper/2605.19733/) (2026)

## Abstract (arXiv)

Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficient way on graphs. We investigate how PUMs can be combined with a local graph basis function (GBF) approximation method in order to obtain low-cost global interpolation or classification schemes. From a theoretical point of view, we study necessary prerequisites for the partition of unity such that global error estimates of the PUM follow from corresponding local ones. Finally, properties of the PUM as cost-efficiency and approximation accuracy are investigated numerically.