Grassmanian Interpolation of Low-Pass Graph Filters: Theory and Applications

• URL: http://arxiv.org/abs/2510.23235v1
• Date: Mon, 27 Oct 2025 11:40:14 GMT
• Title: Grassmanian Interpolation of Low-Pass Graph Filters: Theory and Applications
• Authors: Anton Savostianov, Michael T. Schaub, Benjamin Stamm,
• Abstract summary: Low-pass graph filters are fundamental for signal processing on graphs and other non-Euclidean domains.<n>We suggest a novel algorithm of low-pass graph filter based on Riemannian coordinates in normal coordinates on the Grassmann manifold.<n>We argue that the temporal evolution of the node features may be translated to the evolving graph via a similarity correction to adjust the homophily degree of the network.<n>Second, we suggest a dot product graph family induced by a given static graph which allows to infer improved message passing scheme for node classification facilitated by the filter topology.
• Score: 13.83778274369268
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Low-pass graph filters are fundamental for signal processing on graphs and other non-Euclidean domains. However, the computation of such filters for parametric graph families can be prohibitively expensive as computation of the corresponding low-frequency subspaces, requires the repeated solution of an eigenvalue problem. We suggest a novel algorithm of low-pass graph filter interpolation based on Riemannian interpolation in normal coordinates on the Grassmann manifold. We derive an error bound estimate for the subspace interpolation and suggest two possible applications for induced parametric graph families. First, we argue that the temporal evolution of the node features may be translated to the evolving graph topology via a similarity correction to adjust the homophily degree of the network. Second, we suggest a dot product graph family induced by a given static graph which allows to infer improved message passing scheme for node classification facilitated by the filter interpolation.

Related papers

• A Spectral Interpretation of Redundancy in a Graph Reservoir [51.40366905583043]
  This work revisits the definition of the reservoir in the Multiresolution Reservoir Graph Neural Network (MRGNN)<n>It proposes a variant based on a Fairing algorithm originally introduced in the field of surface design in computer graphics.<n>The core contribution of the paper lies in the theoretical analysis of the algorithm from a random walks perspective.
  arXiv  Detail & Related papers  (2025-07-17T10:02:57Z)
• Signed Graph Learning: Algorithms and Theory [17.374356596021936]
  Real-world data is often represented through the relationships between data samples, forming a graph structure.<n>Current graph learning research has primarily focused on unsigned graphs.<n>We develop a method for capturing a set of smooth signed graph signals.
  arXiv  Detail & Related papers  (2025-07-13T17:33:26Z)
• Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming [26.334739062500674]
  A balanced signed graph has eigenvectors that map via a simple linear transform to ones in a corresponding positive graph.<n>We propose an efficient method to learn a balanced signed graph Laplacian directly from data.
  arXiv  Detail & Related papers  (2025-06-02T16:09:51Z)
• Topological Node2vec: Enhanced Graph Embedding via Persistent Homology [0.0]
  We introduce a topological loss term to be added to the training loss of Node2vec. We measure the discrepancy between PDs in a differentiable way. Our modified loss function can then be minimized through gradient descent to reconstruct both the geometry and the topology of the input graph.
  arXiv  Detail & Related papers  (2023-09-15T08:31:26Z)
• Geometric Graph Filters and Neural Networks: Limit Properties and Discriminability Trade-offs [122.06927400759021]
  We study the relationship between a graph neural network (GNN) and a manifold neural network (MNN) when the graph is constructed from a set of points sampled from the manifold. We prove non-asymptotic error bounds showing that convolutional filters and neural networks on these graphs converge to convolutional filters and neural networks on the continuous manifold.
  arXiv  Detail & Related papers  (2023-05-29T08:27:17Z)
• Multilayer Graph Clustering with Optimized Node Embedding [70.1053472751897]
  multilayer graph clustering aims at dividing the graph nodes into categories or communities. We propose a clustering-friendly embedding of the layers of a given multilayer graph. Experiments show that our method leads to a significant improvement.
  arXiv  Detail & Related papers  (2021-03-30T17:36:40Z)
• Unrolling of Deep Graph Total Variation for Image Denoising [106.93258903150702]
  In this paper, we combine classical graph signal filtering with deep feature learning into a competitive hybrid design. We employ interpretable analytical low-pass graph filters and employ 80% fewer network parameters than state-of-the-art DL denoising scheme DnCNN.
  arXiv  Detail & Related papers  (2020-10-21T20:04:22Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.