A User Guide to Low-Pass Graph Signal Processing and Its Applications: Tools and Applications

The notion of graph filters can be used to define generative models for graph data. In fact, the data obtained from many examples of network dynamics may be viewed as the output of a graph filter. With this interpretation, classical signal processing tools, such as frequency analysis, have been successfully applied with analogous interpretation to graph data, generating new insights for data science. What follows is a user guide on a specific class of graph data, where the generating graph filters are low pass; i.e., the filter attenuates contents in the higher graph frequencies while retaining contents in the lower frequencies. Our choice is motivated by the prevalence of low-pass models in application domains such as social networks, financial markets, and power systems. We illustrate how to leverage properties of low-pass graph filters to learn the graph topology and identify its community structure; efficiently represent graph data through sampling; recover missing measurements; and denoise graph data. The low-pass property is also used as the baseline to detect anomalies.

[1]  E. Kolaczyk,et al.  Statistical Analysis of Network Data with R , 2020, Use R!.

[2]  Anna Scaglione,et al.  Detection of False Data Injection Attack Using Graph Signal Processing for the Power Grid , 2019, 2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[3]  Anna Scaglione,et al.  On Modeling Voltage Phasor Measurements as Graph Signals , 2019, 2019 IEEE Data Science Workshop (DSW).

[4]  Chiara Ravazzi,et al.  Learning Influence Structure in Sparse Social Networks , 2018, IEEE Transactions on Control of Network Systems.

[5]  Asuman E. Ozdaglar,et al.  Identifying Susceptible Agents in Time Varying Opinion Dynamics Through Compressive Measurements , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[6]  Santiago Segarra,et al.  Blind Community Detection From Low-Rank Excitations of a Graph Filter , 2018, IEEE Transactions on Signal Processing.

[7]  Santiago Segarra,et al.  FLOW SMOOTHING AND DENOISING: GRAPH SIGNAL PROCESSING IN THE EDGE-SPACE , 2018, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[8]  Georgios B. Giannakis,et al.  Semi-Blind Inference of Topologies and Dynamical Processes Over Dynamic Graphs , 2018, IEEE Transactions on Signal Processing.

[9]  Evdokia Nikolova,et al.  A Directed Graph Fourier Transform With Spread Frequency Components , 2018, IEEE Transactions on Signal Processing.

[10]  Pierre Vandergheynst,et al.  Graph Signal Processing: Overview, Challenges, and Applications , 2017, Proceedings of the IEEE.

[11]  Paulo Gonçalves,et al.  Design of graph filters and filterbanks , 2017, ArXiv.

[12]  Andreas Loukas,et al.  A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs , 2017, IEEE Transactions on Signal Processing.

[13]  Pascal Frossard,et al.  Learning Heat Diffusion Graphs , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[14]  Geert Leus,et al.  Separable autoregressive moving average graph-temporal filters , 2016, 2016 24th European Signal Processing Conference (EUSIPCO).

[15]  Michael G. Rabbat,et al.  Characterization and Inference of Graph Diffusion Processes From Observations of Stationary Signals , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[16]  Sergio Barbarossa,et al.  On the Graph Fourier Transform for Directed Graphs , 2016, IEEE Journal of Selected Topics in Signal Processing.

[17]  Vassilis Kalofolias,et al.  How to Learn a Graph from Smooth Signals , 2016, AISTATS.

[18]  Antonio Ortega,et al.  Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies , 2015, IEEE Transactions on Signal Processing.

[19]  Sergio Barbarossa,et al.  Signals on Graphs: Uncertainty Principle and Sampling , 2015, IEEE Transactions on Signal Processing.

[20]  Jelena Kovacevic,et al.  Discrete Signal Processing on Graphs: Sampling Theory , 2015, IEEE Transactions on Signal Processing.

[21]  Pascal Frossard,et al.  Learning Laplacian Matrix in Smooth Graph Signal Representations , 2014, IEEE Transactions on Signal Processing.

[22]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[23]  José M. F. Moura,et al.  Discrete Signal Processing on Graphs , 2012, IEEE Transactions on Signal Processing.

[24]  Noah E. Friedkin,et al.  A Formal Theory of Reflected Appraisals in the Evolution of Power , 2011 .

[25]  A. Lo,et al.  Econometric Measures of Connectedness and Systemic Risk in the Finance and Insurance Sectors , 2011 .

[26]  Asuman E. Ozdaglar,et al.  Optimal Pricing in Networks with Externalities , 2011, Oper. Res..

[27]  Tiefeng Jiang,et al.  SPECTRAL DISTRIBUTIONS OF ADJACENCY AND LAPLACIAN MATRICES OF RANDOM GRAPHS , 2010, 1011.2608.

[28]  Bin Yu,et al.  Spectral clustering and the high-dimensional stochastic blockmodel , 2010, 1007.1684.

[29]  H. Stanley,et al.  An Introduction to Econophysics: Correlations and Complexity in Finance , 1999 .

[30]  Susanne Ebersbach,et al.  Power System Analysis And Design , 2016 .

[31]  W. Marsden I and J , 2012 .

[32]  L. Sehgal,et al.  Γ and B , 2004 .

[33]  and as an in , 2022 .