Node-bound communities for partition of unity interpolation on graphs

Roberto Cavoretto, Alessandra De Rossi, Sandro Lancellotti and Federico Romaniello

Applied Mathematics and Computation, 2024, vol. 467, issue C

Abstract: Graph signal processing benefits significantly from the direct and highly adaptable supplementary techniques offered by partition of unity methods (PUMs) on graphs. In our approach, we demonstrate the generation of a partition of unity solely based on the underlying graph structure, employing an algorithm that relies exclusively on centrality measures and modularity, without requiring the input of the number of subdomains. Subsequently, we integrate PUMs with a local graph basis function (GBF) approximation method to develop cost-effective global interpolation schemes. We also discuss numerical experiments conducted on both synthetic and real datasets to assess the performance of this presented technique.

Keywords: Partition of unity methods; Kernel-based approximation; Graph basis functions; Graph signal processing; Graph theory (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323006719
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:467:y:2024:i:c:s0096300323006719

DOI: 10.1016/j.amc.2023.128502

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().