Graph theoretic uncertainty and feasibility

zbMATH Open1407.94198arXiv1603.02059MaRDI QIDQ4609552FDOQ4609552

Paul J. Koprowski

Publication date: 4 April 2018

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$.

Full work available at URL: https://arxiv.org/abs/1603.02059

Recommendations

• The uncertainty principle on Cayley graphs
• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• Wavelets on graphs via spectral graph theory
• Title not available (Why is that?)
• Prolate Spheroidal Wave Functions, Fourier Analysis, and Uncertainty-V: The Discrete Case
• Uncertainty Principles and Signal Recovery
• 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
• Signals on Graphs: Uncertainty Principle and Sampling
• A Spectral Graph Uncertainty Principle
• Vertex-frequency analysis on graphs
• The Heisenberg inequality for the discrete Fourier transform.

Cited In (6)

• Connectivity graphs of uncertainty regions
• A generalization of Gleason's frame function for quantum measurement
• Uncertain graph and network optimization
• Feasible graphs with standard universe
• Uncertain Graph Processing through Representative Instances
• Frequency domain uncertainty and the graph topology

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)