相关论文: Harmonic Analysis on Directed Networks via a Biort…

In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction,…

We study $\Gamma$-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on unions of intersecting manifolds of potentially different dimensions. Our investigation is motivated by problems of machine learning,…

In this paper, we present a novel generalization of the graph Fourier transform (GFT). Our approach is based on separately considering the definitions of signal energy and signal variation, leading to several possible orthonormal GFTs. Our…

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…

We introduce a multi-windowed graph Fourier transform (MWGFT) for the joint vertex-frequency analysis of signals defined on graphs. Building on generalized translation and modulation induced by the graph Laplacian, the proposed framework…

We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…

Learning the graph Laplacian from observed data is one of the most investigated and fundamental tasks in Graph Signal Processing (GSP). Different variants of the Laplacian, such as the combinatorial, signless or signed Laplacians have been…

Deep learning on graphs and in particular, graph convolutional neural networks, have recently attracted significant attention in the machine learning community. Many of such techniques explore the analogy between the graph Laplacian…

Graph Neural Networks (GNNs) conventionally rely on standard Laplacian or adjacency matrices for structural message passing. In this work, we substitute the traditional Laplacian with a Doubly Stochastic graph Matrix (DSM), derived from the…

Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and to represent graph signals with strong correlation by different modes of variation…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the…

Many real-world networks are characterized by directionality; however, the absence of an appropriate Fourier basis hinders the effective implementation of graph signal processing techniques. Inspired by discrete signal processing, where…

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering.…

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 widely-used…

The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and…

We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…

Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…

In Graph Signal Processing (GSP), data dependencies are represented by a graph whose nodes label the data and the edges capture dependencies among nodes. The graph is represented by a weighted adjacency matrix $A$ that, in GSP, generalizes…