Stratified Graph Spectra
Not on the map. Why?
Abstract (arXiv)
In classic graph signal processing, given a real-valued graph signal, its graph Fourier transform is typically defined as the series of inner products between the signal and each eigenvector of the graph Laplacian. Unfortunately, this definition is not mathematically valid in the cases of vector-valued graph signals which however are typical operands in the state-of-the-art graph learning modeling and analyses. Seeking a generalized transformation decoding the magnitudes of eigencomponents from vector-valued signals is thus the main objective of this paper. Several attempts are explored, and also it is found that performing the transformation at hierarchical levels of adjacency help profile the spectral characteristics of signals more insightfully. The proposed methods are introduced as a new tool assisting on diagnosing and profiling behaviors of graph learning models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 85 references that are in the map. First posted on arXiv 10 Jan 2022.
Builds on
26 of 85 references.
References · 26
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2015Gated Graph Sequence Neural Networkscited by 792
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
14 more
- 2017CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filterscited by 203
- 2019Graph Wavelet Neural Networkcited by 131
- 2018Learning graphs from data: A signal representation perspectivecited by 119
- 2017Learning Structural Node Embeddings Via Diffusion Waveletscited by 97
- 2018N-GCN: Multi-scale Graph Convolution for Semi-supervised Node Classificationcited by 54
- 2020Dirichlet Graph Variational Autoencodercited by 40
- 2020Graph Convolutional Network for Recommendation with Low-pass Collaborative Filterscited by 32
- 2014Heat kernel based community detectioncited by 30
- 2014Signal Recovery on Graphs: Variation Minimizationcited by 26
- 2015Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphscited by 26
- 2020Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networkscited by 26
- 2015Influence maximization in complex networks through optimal percolationcited by 20
- 2015Distinct types of eigenvector localization in networkscited by 4
- 2018Eigenvector localization in real networks and its implications for epidemic spreadingcited by 1
Built on by
Not cited yet.