Distributed Autoregressive Moving Average Graph Filters

Abstract

We introduce the concept of autoregressive moving average (ARMA) filters on a graph and show how they can be implemented in a distributed fashion. Our graph filter design philosophy is independent of the particular graph, meaning that the filter coefficients are derived irrespective of the graph. In contrast to finite-impulse response (FIR) graph filters, ARMA graph filters are robust against changes in the signal and/or graph. In addition, when time-varying signals are considered, we prove that the proposed graph filters behave as ARMA filters in the graph domain and, depending on the implementation, as first or higher ARMA filters in the time domain.

5 pages, 3 figures

References in corpus (1)

• Discrete Signal Processing on Graphs

Cited by in corpus (12)

• Graph Neural Networks with convolutional ARMA filters
• Autoregressive Moving Average Graph Filtering
• Stationary Graph Processes and Spectral Estimation
• Joint Detection and Localization of Stealth False Data Injection Attacks in Smart Grids using Graph Neural Networks
• Advances in Distributed Graph Filtering
• Filtering Random Graph Processes Over Random Time-Varying Graphs
• Graph-signal Reconstruction and Blind Deconvolution for Structured Inputs
• Frequency Analysis of Temporal Graph Signals
• DCT and DST Filtering with Sparse Graph Operators
• Designing Asymmetric Shift Operators for Decentralized Subspace Projection
• Localization bounds for the graph translation
• Online Distributed Learning over Graphs with Multitask Graph-Filter Models