Work

Community detection methods for GBF-PUM signal approximation on graphs

Year: 2025

Type: article

Abstract: Graph signal approximation plays a key role in processing irregularly distributed data on graphs, where achieving smooth and computationally efficient interpolation is essential. In this work, we introduce a new approach that combines a spectral community detection technique with the partition of unity method (PUM) applied to signal approximation on graphs. The PUM provides an effective technique for handling irregularly distributed data by dividing the graph into smaller subgraphs, constructing local interpolants and combining them to produce a global approximation. Since the first step in the PUM consists in dividing the graph into disjoint communities, we focus in particular on exploring and testing some community detection algorithms based on the maximization of the modularity. Then, we integrate the PUM with a local graph basis function approximation scheme, resulting in an accurate and computationally efficient approach for graph signal approximation.

Source: Applied Mathematics and Computation

DOI: 10.1016/j.amc.2025.129702

Authors: Roberto Cavoretto, Chiara Comoglio, Alessandra De Rossi

Institutions: Istituto Nazionale di Alta Matematica Francesco Severi, University of Turin

Language: English

Topic: Advanced Graph Neural Networks

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,470

Funders: Istituto Nazionale di Alta Matematica "Francesco Severi", Gruppo Nazionale per il Calcolo Scientifico, NextGenerationEU