Graph theoretic uncertainty and feasibility

2016/02/18 by Koprowski, Paul J.
#Classical Analysis and ODEs (math.CA) #FOS: Mathematics #Functional Analysis (math.FA) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1603.02059

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 ℝ².

Related

• On Graph Uncertainty Principle and Eigenvector Delocalization
• An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
• Toward An Uncertainty Principle For Weighted Graphs
• Shapes of Uncertainty in Spectral Graph Theory
• Global and Local Uncertainty Principles for Signals on Graphs