Graph theoretic uncertainty principles

Abstract

We develop 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 operator dictate the upper and lower bounds for the inequalities.