Graph theoretic uncertainty and feasibility
Classical Analysis and ODEs
2016-03-08 v1 Functional Analysis
Optimization and Control
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 .
Cite
@article{arxiv.1603.02059,
title = {Graph theoretic uncertainty and feasibility},
author = {Paul J. Koprowski},
journal= {arXiv preprint arXiv:1603.02059},
year = {2016}
}