4.5 Article

Sampling in Paley-Wiener spaces on combinatorial graphs

Journal

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
Volume 360, Issue 10, Pages 5603-5627

Publisher

AMER MATHEMATICAL SOC
DOI: 10.1090/S0002-9947-08-04511-X

Keywords

combinatorial graph; combinatorial Laplace operator; discrete Paley-Wiener spaces; Shannon sampling; discrete Plancherel-Polya and Poincare inequalities

Categories

Ask authors/readers for more resources

A notion of Paley-Wiener spaces on combinatorial graphs is introduced. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such uniqueness sets are described in terms of Poincare-Wirtinger-type inequalities. A reconstruction algorithm of Paley-Wiener functions from uniqueness sets which uses the idea of frames in Hilbert spaces is developed. Special consideration is given to the n-dimensional lattice, homogeneous trees, and eigenvalue and eigenfunction problems on finite graphs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available