Half sampling on bipartite graphs
DOI10.1007/S00041-015-9452-8zbMATH Open1348.05129OpenAlexW2265396654MaRDI QIDQ334963FDOQ334963
Authors: Robert S. Strichartz 
Publication date: 1 November 2016
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00041-015-9452-8
Recommendations
samplingbipartite graphshalf-bandlimitedhalf-samplinghomogeneous treesspectral resolution of Laplacians
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Infinite graphs (05C63) Discrete version of topics in analysis (39A12) Nontrigonometric harmonic analysis (42C99)
Cites Work
- A Survey on Spectra of infinite Graphs
- Irregular sampling theorems and series expansions of band-limited functions
- Iterative Reconstruction of Multivariate Band-Limited Functions from Irregular Sampling Values
- Harmonic analysis for anisotropic random walks on homogeneous trees
- Title not available (Why is that?)
- Sampling formulas for groups of operators in Banach spaces
- Spectral analysis on infinite Sierpiński fractafolds
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Erratum to ‘‘Sampling in Paley-Wiener spaces on combinatorial graphs”
- Title not available (Why is that?)
- A sampling theorem on homogeneous manifolds
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-Channel Oversampled Graph Filter Banks
- Oversampled Graph Laplacian Matrix for Graph Filter Banks
- Discrete Signal Processing on Graphs: Sampling Theory
- Title not available (Why is that?)
- Exact sampling of graphs with prescribed degree correlations
- A Reconstruction Method for Band-Limited Signals on the Hyperbolic Plane
- Transformation of spectra of graph laplacians
- Sampling, filtering and sparse approximations on combinatorial graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
Cited In (6)
- Graph signal sampling and interpolation based on clusters and averages
- Exploration of kernel parameters in signal GBF-PUM approximation on graphs
- Weighting estimation under bipartite incidence graph sampling
- Spatio–Spectral Limiting on Redundant Cubes: A Case Study
- Overview of the topical collection: harmonic analysis on combinatorial graphs
- Numerical integration on graphs: Where to sample and how to weigh
This page was built for publication: Half sampling on bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334963)
