Filter Learning for Subgraphs: Algebras and Performance Risk Bounds
A subgraph filter algebra based on distance-aware Laplacian constructions is developed, defining a structured and controllable class of filters for effective approximation and quantifying how well the learned operator approximates the restricted ambient mapping.