Approximation theorems on graphs
DOI10.1016/j.jat.2021.105620zbMath1473.05296OpenAlexW3178536484WikidataQ113871926 ScholiaQ113871926MaRDI QIDQ822731
Jianfeng Huang, Chao Huang, Lihua Yang, Qian Zhang
Publication date: 23 September 2021
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2021.105620
Bernstein inequalityJackson inequalitymodulus of smoothnessPaley-Wiener spacesfunctions on combinatorial graphsgraph translation operators
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Rate of convergence, degree of approximation (41A25) Graph theory (05C99) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Approximations and expansions (41A99)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling, filtering and sparse approximations on combinatorial graphs
- Wavelets on graphs via spectral graph theory
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Vertex-frequency analysis on graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
- Parseval wavelets on hierarchical graphs
- Random sampling of bandlimited signals on graphs
- Random forests and networks analysis
- Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Diffusion wavelets
- Sparse representation on graphs by tight wavelet frames and applications
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Learning Parametric Dictionaries for Signals on Graphs
- Local-Set-Based Graph Signal Reconstruction
- Discrete Signal Processing on Graphs: Sampling Theory
- Sampling of Graph Signals With Successive Local Aggregations
- Signals on Graphs: Uncertainty Principle and Sampling
- Learning Laplacian Matrix in Smooth Graph Signal Representations
- Greedy Sampling of Graph Signals
- A Multiscale Pyramid Transform for Graph Signals
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Subgraph-Based Filterbanks for Graph Signals
- Uncertainty Principles and Sparse Eigenvectors of Graphs
- On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing
- Graph Topology Inference Based on Sparsifying Transform Learning
- Quantum Theory for Mathematicians
- A Spectral Graph Uncertainty Principle
- Poincaré and Plancherel--Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs
This page was built for publication: Approximation theorems on graphs
