Graph theoretic uncertainty and feasibility

MaRDI QIDQ4609552zbMATH OpenFDO

Authors Paul J. Koprowski

Publication date 4 April 2018

Full work available at URL https://arxiv.org/abs/1603.02059, http://stsip.org/pdf/vol15/vol15pp73-93.pdf

zbMATH Keywords

graph theoryuncertainty principleFourier analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15)

Abstract: We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and a modified normalized graph Laplacian operator dictate the upper and lower bounds for the inequalities. Finally, we establish the feasibility region of difference estimator values in $mathbb{R}^2$.

Recommendations

• The uncertainty principle on Cayley graphs
• scientific article; zbMATH DE number 4103122
• An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
• Weak uncertainty principle for fractals, graphs and metric measure spaces
• Minimax lower bounds for function estimation on graphs

Cites work

• scientific article; zbMATH DE number 3889718 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Spectral Graph Uncertainty Principle
• A remark on the rank of positive semidefinite matrices subject to affine constraints
• An uncertainty principle for finite frames
• Discrete Signal Processing on Graphs: Frequency Analysis
• Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
• Signals on Graphs: Uncertainty Principle and Sampling
• The Heisenberg inequality for the discrete Fourier transform.
• Uncertainty Principles and Signal Recovery
• Vertex-frequency analysis on graphs
• Wavelets on graphs via spectral graph theory

Cited in

(6)

• Uncertain Graph Processing through Representative Instances
• Uncertain graph and network optimization
• A generalization of Gleason's frame function for quantum measurement
• An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
• Frequency domain uncertainty and the graph topology
• Feasible graphs with standard universe

This page was built for publication: Graph theoretic uncertainty and feasibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609552)