Subgraph Signal Processing
Graph signal processing, like the graph Fourier transform, requires the full graph signal at every vertex of the graph. However, in practice, only signals at a subset of vertices may be available. We propose a subgraph signal processing framework that relates a graph shift operator or filter on a subgraph with a filter on the ambient graph through an operator loss. It allows us to define shift operators for the subgraph signal, which has a meaningful interpretation and relation to mixtures of shift invariant filters restricted to different subgraphs of the ambient graph (which we call semi shift invariant). This leads to a notion of frequency domain for the subgraph signal consistent in some sense with that of the full graph signal. We apply the subgraph signal processing machinery to several applications and demonstrate the utility of this framework in cases where only partial graph signals are observed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Guiding Network Analysis using Graph Slepians: An Illustration for the C. Elegans Connectome
Spectral approaches of network analysis heavily rely upon the eigendecomposition of the graph Laplacian. For instance, in graph signal processing, the Laplacian eigendecomposition is used to define the graph Fourier tran…
A Graph Signal Processing Approach For Real-Time Traffic Prediction In Transportation Networks
Accurate real-time traffic prediction has a key role in traffic management strategies and intelligent transportation systems. Building a prediction model for transportation networks is challenging because spatio-temporal…
ClusteringManagementPredictionTime Series+2A Spectral Framework for Anomalous Subgraph Detection
A wide variety of application domains are concerned with data consisting of entities and their relationships or connections, formally represented as graphs. Within these diverse application areas, a common problem of int…
Community DetectionFilter Learning for Subgraphs: Algebras and Performance Risk Bounds
Graph signal processing tasks that leverage spectral information typically assume access to the complete graph topology, which is often unavailable in practice. We propose a systematic framework for subgraph filter learn…
Subgraph Detection Using Eigenvector L1 Norms
When working with network datasets, the theoretical framework of detection theory for Euclidean vector spaces no longer applies. Nevertheless, it is desirable to determine the detectability of small, anomalous graphs emb…