Sampling in Paley-Wiener spaces on combinatorial graphs

From MaRDI portal
Publication:3533847

DOI10.1090/S0002-9947-08-04511-XzbMath1165.42010MaRDI QIDQ3533847

Isaac Z. Pesenson

Publication date: 24 October 2008

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)




Related Items (32)

Approximation theorems on graphsHarmonic analysis invariants for infinite graphs via operators and algorithmsSequences of well-distributed vertices on graphs and spectral bounds on optimal transportGraph signal sampling and interpolation based on clusters and averagesPolynomial control on stability, inversion and powers of matrices on simple graphsHalf sampling on bipartite graphsGraph signal interpolation with positive definite graph basis functionsAdaptive directional Haar tight framelets on bounded domains for digraph signal representationsGabor-type frames for signal processing on graphsOverview of the topical collection: harmonic analysis on combinatorial graphsSampling, filtering and sparse approximations on combinatorial graphsRandom sampling of bandlimited signals on graphsSpatially distributed sampling and reconstructionGraphical designs and gale dualityGraphical designs and extremal combinatoricsOptimization Methods for Frame Conditioning and Application to Graph Laplacian ScalingReal Paley-Wiener theorems for Fourier seriesLocal measurement and diffusion reconstruction for signals on a weighted graphA low discrepancy sequence on graphsCodes, cubes, and graphical designsGeometric space-frequency analysis on manifoldsSeven pivotal theorems of Fourier analysis, signal analysis, numerical analysis and number theory: their interconnectionsEigenmaps and minimal and bandlimited immersions of graphs into Euclidean spacesRemovable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphsA Sheaf-Theoretic Perspective on SamplingNumerical integration on graphs: Where to sample and how to weighPartition of unity methods for signal processing on graphsErratum to ‘‘Sampling in Paley-Wiener spaces on combinatorial graphs”Interpolating splines on graphs for data science applicationsSampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRISpatio–Spectral Limiting on Redundant Cubes: A Case StudySampling by Averages and Average Splines on Dirichlet Spaces and on Combinatorial Graphs



Cites Work


This page was built for publication: Sampling in Paley-Wiener spaces on combinatorial graphs