Overview of the topical collection: harmonic analysis on combinatorial graphs
DOI10.1007/s00041-022-09904-yzbMath1484.42002OpenAlexW4220753880MaRDI QIDQ2670661
Qiyu Sun, Isaac Z. Pesenson, Stefan Steinerberger
Publication date: 11 March 2022
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-022-09904-y
interpolationsamplingsplinespartition of unity methodshigher-order spectral clustering for geometric graphsHilbert frames in \(L_2\)-spacesPaley-Wiener functions on graphs and manifoldspolynomials on fractalsspectrum of a combinatorial Laplace operator of a finite graph
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Singular and oscillatory integrals (Calderón-Zygmund, etc.) (42B20) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General harmonic expansions, frames (42C15) Graph theory (05C99) Proceedings, conferences, collections, etc. pertaining to harmonic analysis on Euclidean spaces (42-06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Half sampling on bipartite graphs
- Sampling, filtering and sparse approximations on combinatorial graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Approximation theorems on graphs
- Harmonic analysis invariants for infinite graphs via operators and algorithms
- Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport
- Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel
- Sobolev orthogonal polynomials on the Sierpinski gasket
- Graph signal sampling and interpolation based on clusters and averages
- Natural graph wavelet packet dictionaries
- Random sampling of bandlimited signals on graphs
- Laplacians on infinite graphs: Dirichlet and Neumann boundary conditions
- A low discrepancy sequence on graphs
- Codes, cubes, and graphical designs
- Manifold learning with arbitrary norms
- The dual graph shift operator: identifying the support of the frequency domain
- Partition of unity methods for signal processing on graphs
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Polynomial control on weighted stability bounds and inversion norms of localized matrices on simple graphs
- Spatially distributed sampling and reconstruction
- Adaptive directional Haar tight framelets on bounded domains for digraph signal representations
- Asymptotically optimal strategies for online prediction with history-dependent experts
- Higher-order spectral clustering for geometric graphs
- Gabor-type frames for signal processing on graphs
- Essential self-adjointness and the \(L^2\)-Liouville property
- Stochastic completeness of graphs: bounded Laplacians, intrinsic metrics, volume growth and curvature
- On recovery guarantees for angular synchronization
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Numerical integration on graphs: Where to sample and how to weigh
- Sampling by Averages and Average Splines on Dirichlet Spaces and on Combinatorial Graphs
- Generalized Solutions and Spectrum for Dirichlet Forms on Graphs
- Poincaré and Plancherel--Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs
- Sampling of band-limited vectors
This page was built for publication: Overview of the topical collection: harmonic analysis on combinatorial graphs
