Haar-Laplacian for directed graphs
This paper introduces a novel Laplacian matrix aiming to enable the construction of spectral convolutional networks and to extend the signal processing applications for directed graphs. Our proposal is inspired by a Haar-like transformation and produces a Hermitian matrix which is not only in one-to-one relation with the adjacency matrix, preserving both direction and weight information, but also enjoys desirable additional properties like scaling robustness, sensitivity, continuity, and directionality. We take a theoretical standpoint and support the conformity of our approach with the spectral graph theory. Then, we address two use-cases: graph learning (by introducing HaarNet, a spectral graph convolutional network built with our Haar-Laplacian) and graph signal processing. We show that our approach gives better results in applications like weight prediction and denoising on directed graphs.
Code (1)
Tasks
DenoisingGraph LearningSimilar Papers 제목 키워드 기반
Characterizing bearing equivalence in directed graphs
In this paper, we study bearing equivalence in directed graphs. We first give a strengthened definition of bearing equivalence based on the \textit{kernel equivalence} relationship between bearing rigidity matrix and bea…
Graph Learning in 4D: a Quaternion-valued Laplacian to Enhance Spectral GCNs
We introduce QuaterGCN, a spectral Graph Convolutional Network (GCN) with quaternion-valued weights at whose core lies the Quaternionic Laplacian, a quaternion-valued Laplacian matrix by whose proposal we generalize two …
Graph LearningA Unified Spectral Sparsification Framework for Directed Graphs
Recent spectral graph sparsification research allows constructing nearly-linear-sized subgraphs that can well preserve the spectral (structural) properties of the original graph, such as the first few eigenvalues and eig…
Modelling and Kron reduction of power flow networks in directed graphs
Electrical grids are large-sized complex systems that require strong computing power for monitoring and analysis. Kron reduction is a general reduction method in graph theory and is often used for electrical circuit simp…
Nonlinear Laplacians Improve Signed-Directed Graph Learning
While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks. We int…
Node ClassificationLink PredictionGraph Learning