4.5 Article

Shapes of Uncertainty in Spectral Graph Theory

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 67, Issue 2, Pages 1291-1307

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2020.3039310

Keywords

Location awareness; Visualization; Uncertainty; Shape; Tools; Graph theory; Filtering theory; Uncertainty principle; spectral graph theory; numerical range of matrices; space-frequency analysis of signals on graphs

Funding

  1. European Union's Horizon 2020 Research and Innovation Programme ERA-PLANET, University of Padova [689443]

Ask authors/readers for more resources

This research presents a flexible framework for uncertainty principles in spectral graph theory, incorporating general filter functions to model the spatial and spectral localization of a graph signal. By utilizing theoretical and computational aspects of the numerical range of matrices, the shapes of uncertainty curves can be characterized and studied, as well as the space-frequency localization of signals within admissibility regions.
We present a flexible framework for uncertainty principles in spectral graph theory. In this framework, general filter functions modeling the spatial and spectral localization of a graph signal can be incorporated. It merges several existing uncertainty relations on graphs, among others the Landau-Pollak principle describing the joint admissibility region of two projection operators, and uncertainty relations based on spectral and spatial spreads. Using theoretical and computational aspects of the numerical range of matrices, we are able to characterize and illustrate the shapes of the uncertainty curves and to study the space-frequency localization of signals inside the admissibility regions.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Mathematics, Applied

Mathematical analysis of the 1D model and reconstruction schemes for magnetic particle imaging

W. Erb, A. Weinmann, M. Ahlborg, C. Brandt, G. Bringout, T. M. Buzug, J. Frikel, C. Kaethner, T. Knopp, T. Maerz, M. Moeddel, M. Storath, A. Weber

INVERSE PROBLEMS (2018)

Article Mathematics, Applied

A new 3D model for magnetic particle imaging using realistic magnetic field topologies for algebraic reconstruction

Gael Bringout, Wolfgang Erb, Juergen Frikel

INVERSE PROBLEMS (2020)

Article Mathematics, Applied

Partition of Unity Methods for Signal Processing on Graphs

Roberto Cavoretto, Alessandra De Rossi, Wolfgang Erb

Summary: Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. By combining PUMs with local graph basis function (GBF) approximation methods, low-cost global interpolation or classification schemes can be achieved. Theoretical prerequisites for PUMs and their global error estimates have been studied, while properties like cost-efficiency and approximation accuracy have been investigated numerically.

JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS (2021)

Article Mathematics, Applied

Graph signal interpolation with positive definite graph basis functions

Wolfgang Erb

Summary: This paper introduces the concept of positive definite functions on graphs for the interpolation of graph signals with generalized shifts of a graph basis function (GBF). By describing and analyzing positive definite functions, we design GBFs and study the interpolation error and numerical stability. Finally, we demonstrate the application of using GBF interpolation to derive quadrature formulas on graphs.

APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2022)

Article Computer Science, Artificial Intelligence

Empowering Simple Graph Convolutional Networks

Luca Pasa, Nicolo Navarin, Wolfgang Erb, Alessandro Sperduti

Summary: Many neural networks for graphs are based on the graph convolution operator proposed more than a decade ago. Recently, a simplified version called simple graph convolution has been proposed, which aims to remove nonlinearities. In this article, the authors propose, analyze, and compare different simple graph convolution operators that can be implemented in single-layer graph convolutional networks, showing competitive predictive performance on node classification benchmark datasets.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Mathematics, Applied

SHAPE-DRIVEN INTERPOLATION WITH DISCONTINUOUS KERNELS: ERROR ANALYSIS, EDGE EXTRACTION, AND APPLICATIONS IN MAGNETIC PARTICLE IMAGING

S. De Marchi, W. Erb, F. Marchetti, E. Perracchione, M. Rossini

SIAM JOURNAL ON SCIENTIFIC COMPUTING (2020)

No Data Available